729 search results - page 45 / 146 » Solving subgraph isomorphism problems with constraint progra... |
123
Voted
VLSID
1994
IEEE
15 years 7 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
127
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
151
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
105
Voted
INFORMS
2008
15 years 3 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
105
Voted
SIAMJO
2008
15 years 3 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...