A simplex procedure for linear programs with some 0-1 integer constraints

DOI10.1016/0377-2217(82)90179-5zbMath0477.90036OpenAlexW2079771505MaRDI QIDQ1160561

Amiya K. Chakravarty

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90179-5

zbMATH Keywords

simplex algorithm0-1 integer constraintsadjacent vertex cut techniquemultiple 0-1 constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09)

Cites Work

• The Generalized Lattice-Point Problem
• Convexity Cuts and Cut Search
• Unnamed Item
• Unnamed Item

This page was built for publication: A simplex procedure for linear programs with some 0-1 integer constraints