Cyclic group and knapsack facets
From MaRDI portal
Publication:1424275
DOI10.1007/s10107-003-0390-xzbMath1082.90094OpenAlexW2073057258WikidataQ101069343 ScholiaQ101069343MaRDI QIDQ1424275
Ralph E. Gomory, Julián Aráoz, Lisa Evans, Ellis L. Johnson
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0390-x
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Knapsack polytopes: a survey, A concise characterization of strong knapsack facets, On the extreme inequalities of infinite group problems, Two row mixed-integer cuts via lifting, Extended formulations for Gomory corner polyhedra, Theoretical challenges towards cutting-plane selection, Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra, Mixed-integer cuts from cyclic groups, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, A few strong knapsack facets, The master equality polyhedron with multiple rows, Cyclic group blocking polyhedra, On a generalization of the master cyclic group polyhedron, On the strength of Gomory mixed-integer cuts as group cuts, The worst case analysis of strong knapsack facets, Relations between facets of low- and high-dimensional group problems, Valid inequalities based on the interpolation procedure, An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem, On the lattice programming gap of the group problems, Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions, Valid inequalities for mips and group polyhedra from approximate liftings, IFORS' Operational Research Hall of Fame, Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations, Valid inequalities based on simple mixed-integer sets, Cover and pack inequalities for (mixed) integer programming, Airline crew scheduling: state-of-the-art, Light on the infinite group relaxation. I: Foundations and taxonomy
