CPAIOR
2010
Springer
14 years 4 months ago
2010
Springer
CPAIOR
2010
Springer
14 years 4 months ago
2010
Springer
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
CPAIOR
2010
Springer
14 years 4 months ago
2010
Springer
We present a maintenance scheduling problem arising from semi-conductor manufacturing which is characterized by low resource contention and multiple complex objectives and prefere...
CPAIOR
2010
Springer
14 years 4 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...
CPAIOR
2010
Springer
14 years 4 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...