A Polyhedral Study of the Mixed Integer Cut

DOI10.1007/978-3-642-13036-6_10zbMath1285.90020OpenAlexW1576807649MaRDI QIDQ3569813

Steve Tyber, Ellis L. Johnson

Publication date: 22 June 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_10

zbMATH Keywords

integer programmingcutting planesgroup relaxationmaster cyclic group polyhedronmaster knapsack polytope

Mathematics Subject Classification ID

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

Related Items (2)

Knapsack polytopes: a survey ⋮ A concise characterization of strong knapsack facets

This page was built for publication: A Polyhedral Study of the Mixed Integer Cut