327 search results - page 25 / 66 » Cutting planes in integer and mixed integer programming |
SAT
2009
Springer
15 years 7 months ago
2009
Springer
The concept of backdoor variables has been introduced as a structural property of combinatorial problems that provides insight into the surprising ability of modern satisfiability...
102
click to vote
CP
2004
Springer
15 years 6 months ago
2004
Springer
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...
141
click to vote
ENDM
2010
14 years 10 months ago
2010
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
ASPDAC
2006
ACM
15 years 7 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
121
click to vote
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Mixed Multi-Unit Combinatorial Auctions extend and generalise all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical ap...