Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm

DOI10.1287/opre.19.6.1518zbMath0228.90033OpenAlexW2129995885WikidataQ124795386 ScholiaQ124795386MaRDI QIDQ5636693

S. J. Jun. Mathis

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.6.1518

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

Estimation of the number of iterations in integer programming algorithms using the regular partitions method ⋮ The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques

This page was built for publication: Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm