Cropped cubes

DOI10.1023/A:1024475030446zbMath1035.90108OpenAlexW4245498303MaRDI QIDQ1402537

Jon Lee

Publication date: 28 August 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024475030446

zbMATH Keywords

polytopelinear programinteger programbalanced matrixtotally dual integralideal matrixgeneralized set coveringclipped cubecropped cube

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)

Related Items (9)

In situ column generation for a cutting-stock problem ⋮ The max-flow min-cut property and \(\pm 1\)-resistant sets ⋮ Cuboids, a class of clutters ⋮ Idealness and 2-resistant sets ⋮ Resistant Sets in the Unit Hypercube ⋮ A family of easy polyhedra ⋮ Forbidden Vertices ⋮ Parsimonious binary-encoding in integer programming ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

This page was built for publication: Cropped cubes