Benchmark Problems for Constraint Solving
Alin Suciu, Rodica Potolea, Tudor Muresan
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.
Create a lesson
Related papers
FoldPipe: Bounded Remote Streaming of Native Molecular Shards with Asynchronous Prefetch
Dhiren Mukesh Khatri
TOPIQ: Statistical Error Propagation for Quantity-of-Interest Prediction under Lossy Compression
Youyuan Liu, Bo Jiang, Taolue Yang et al.
Launch-Bound and Substitutable: Why Three Inference Optimizations Fail to Pay Off in Mixture-of-Experts Models
Gokulakannan Sakthivel, Jerry Wu, Amogh Rajendra et al.
Direct-Operable SIMD Bit-Slicing: A Framework for Memory-Efficient Predicate Evaluation
Arunkumar Mathiyazhagan
When Structure is Silent: Opportunities for Algorithmic Dispatch in Linear Algebra
Emmanuel Lujan, Alan Edelman
Portable to Efficient: Auto-Tuning Hardware-Agnostic GPU Kernels in Julia
Floris-Jan Willemsen, Evelyne Ringoot, Alan Edelman