Sciweavers

171 search results - page 3 / 35
» Searching for a Solution to Program Verification=Equation So...
Sort
View
PATAT
2004
Springer
148views Education» more  PATAT 2004»
14 years 6 days ago
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
Hadrien Cambazard, Fabien Demazeau, Narendra Jussi...
CPAIOR
2010
Springer
13 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
CP
2005
Springer
14 years 12 days ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
INFORMS
2010
125views more  INFORMS 2010»
13 years 5 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 6 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende