Primal cutting plane algorithms revisited

DOI10.1007/s001860200200zbMath1023.90087OpenAlexW2029403470WikidataQ57702356 ScholiaQ57702356MaRDI QIDQ1396918

Andrea Lodi, Adam N. Letchford

Publication date: 14 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860200200

zbMATH Keywords

integer programmingcutting planesprimal algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (8)

Convex analysis in groups and semigroups: a sampler ⋮ Integral simplex using decomposition with primal cutting planes ⋮ Integral Column Generation for Set Partitioning Problems with Side Constraints ⋮ On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming ⋮ Integral simplex using double decomposition for set partitioning problems ⋮ Influence of the normalization constraint on the integral simplex using decomposition ⋮ Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation ⋮ Improving set partitioning problem solutions by zooming around an improving direction

This page was built for publication: Primal cutting plane algorithms revisited