19 search results - page 2 / 4 » Active-constraint variable ordering for faster feasibility o... |
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
CONCUR
2000
Springer
13 years 12 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
COR
2010
13 years 7 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...