Nutmeg: a MIP and CP hybrid solver using branch-and-check

DOI10.1007/s43069-020-00023-2zbMath1459.90133OpenAlexW3085049663MaRDI QIDQ2226478

Graeme Gange, Edward Lam, Peter J. Stuckey, Jip J. Dekker, Pascal Van Hentenryck

Publication date: 8 February 2021

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-020-00023-2

zbMATH Keywords

mixed integer programminglinear constraintsconstraint programminghybridizationlogic-based Benders decompositiondual boundconflict analysislazy clause generationbranch-and-checknogood

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (6)

Branch-and-cut-and-price for multi-agent path finding ⋮ Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ Strengthening of feasibility cuts in logic-based benders decomposition

Uses Software

• SCIP
• MiniZinc
• GCG
• CHUFFED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved filtering for weighted circuit constraints
• Explaining the \texttt{cumulative} propagator
• SCIP: solving constraint integer programs
• The capacity and distance constrained plant location problem
• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• Earth observation satellite management
• Optimization-oriented global constraints
• Cost-based arc consistency for global cardinality constraints
• Propagation via lazy clause generation
• A branch-and-price-and-check model for the vehicle routing problem with location congestion
• Conflict analysis in mixed integer programming
• Integer Programming
• Planning and Scheduling by Logic-Based Benders Decomposition
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Nutmeg: a MIP and CP hybrid solver using branch-and-check