On a Generalization of the Master Cyclic Group Polyhedron

DOI10.1007/978-3-540-72792-7_16zbMath1136.90404OpenAlexW1544454726MaRDI QIDQ5429268

Ricardo Fukasawa, Oktay Günlük, Sanjeeb Dash

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_16

zbMATH Keywords

integer programmingpolyhedral combinatorics

Mathematics Subject Classification ID

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

Related Items (2)

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems ⋮ Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

This page was built for publication: On a Generalization of the Master Cyclic Group Polyhedron