151
Voted
OR
14 years 10 months ago
2010 Springer 
Abstract With potential application to a variety of industries, fleet sizing problems present a prevalent and significant challenge for engineers and managers. This is especially t...
151
click to vote
CPAIOR
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...
137
click to vote
CPAIOR
15 years 8 months ago
2010 Springer 
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
152
click to vote
CPAIOR
15 years 8 months ago
2010 Springer 
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
192
Voted
CPAIOR
15 years 1 months ago
2010 Springer 
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...
|
Operations Research