Benchmark Problems for Constraint Solving

Details Benchmark Problems for Constraint Solving Benchmark Problems for Constraint Solving

2006-03-26

arxiv.org/abs/cs/0603099v1

Computer Science

Performance

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Benchmark Problems for Constraint Solving does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Benchmark Problems for Constraint Solving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Benchmark Problems for Constraint Solving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413363