Benchmark Problems for Constraint Solving
Alin Suciu, Rodica Potolea, Tudor Muresan
TL;DR
This paper introduces three benchmark problems derived from electrical network constraints and evaluates five different constraint solving systems on these problems, highlighting their varying performance.
Contribution
It defines a new set of benchmark problems for constraint solving based on electrical networks and provides a comparative evaluation of multiple systems.
Findings
Different systems excel on different problems
Performance varies significantly across systems and problems
Benchmarking reveals strengths and weaknesses of each system
Abstract
Constraint 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Model-Driven Software Engineering Techniques · Scheduling and Optimization Algorithms