Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling

DOI10.1007/978-3-642-38171-3_22zbMath1382.90061OpenAlexW1599113327MaRDI QIDQ4922921

Elvin Çoban, Andre A. Cire, John N. Hooker

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_22

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Constraint programming and operations research ⋮ Temporal linear relaxation in IBM ILOG CP optimizer ⋮ Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling

Uses Software

• SIMPL

This page was built for publication: Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling