A primal all-integer algorithm based on irreducible solutions

DOI10.1007/s10107-003-0384-8zbMath1059.90106OpenAlexW1989905452MaRDI QIDQ1424268

Utz-Uwe Haus, Matthias Köppe, Robert Weismantel

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-0384-8

zbMATH Keywords

integer programmingintegral basis methodprimal augmentation algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (9)

Column basis reduction and decomposable knapsack problems ⋮ Extended formulations for Gomory corner polyhedra ⋮ Integral simplex using decomposition with primal cutting planes ⋮ A quadratic simplex algorithm for primal optimization over zero-one polytopes ⋮ Compact representations of all members of an independence system ⋮ Optimality criterion for a class of nonlinear integer programs. ⋮ Cone superadditivity of discrete convex functions ⋮ Influence of the normalization constraint on the integral simplex using decomposition ⋮ Approximate extended formulations

Uses Software

• MIPLIB

This page was built for publication: A primal all-integer algorithm based on irreducible solutions