Sciweavers

729 search results - page 58 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
122
Voted
CP
2004
Springer
15 years 9 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
153
Voted
TABLEAUX
1995
Springer
15 years 7 months ago
Constraint Model Elimination and a PTTP-Implementation
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
Peter Baumgartner, Frieder Stolzenburg
108
Voted
PADL
2010
Springer
16 years 17 days ago
Automating Mathematical Program Transformations
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
Ashish Agarwal, Sooraj Bhat, Alexander Gray, Ignac...
151
Voted
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 3 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
144
Voted
SARA
2009
Springer
15 years 10 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers