Benchmark Problems for Constraint Solving

Simple item page
dc.creatorSuciu, Alin
dc.creatorPotolea, Rodica
dc.creatorMuresan, Tudor
dc.date2006-03-26
dc.date.accessioned2026-07-07T07:05:54Z
dc.date.available2026-07-07T07:05:54Z
dc.descriptionConstraint Programming is roughly a new software technology introduced by Jaffar and Lassez in 1987 for description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling. In the following we define three problems for constraint solving from the domain of electrical networks; based on them we define 43 related problems. For the defined set of problems we benchmarked five systems: ILOG OPL, AMPL, GAMS, Mathematica and UniCalc. As expected some of the systems performed very well for some problems while others performed very well on others.
dc.identifierhttps://arxiv.org/abs/cs/0603099
dc.identifierhttp://arxiv.org/abs/cs/0603099
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109836
dc.subjectPerformance
dc.subjectSymbolic Computation
dc.titleBenchmark Problems for Constraint Solving
dc.typetext

Files

Collections

arXiv