Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems

DOI10.1007/978-1-4419-1644-0_4zbMath1202.90127OpenAlexW151080287MaRDI QIDQ3064561

Pedro M. Castro, Ignacio E. Grossmann, Louis-Martin Rousseau

Publication date: 22 December 2010

Published in: Hybrid Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-1644-0_4

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints

This page was built for publication: Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems