Intermediate feasibility in 0–1 integer linear systems

DOI10.1007/BFB0121052MaRDI QIDQ3716812zbMATH OpenOpenAlexFDO

Authors Patricia J. Carstensen, Clovis Perin, Katta G. Murty

Publication date 1985

Published in Mathematical Programming Essays in Honor of George B. Dantzig Part I (Search for Journal in Brave)

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

zbMATH Keywords

0-1 integer linear systemsconnected undirected networkcoveringsintermediate feasibility propertymatchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1953187
• The complexity of recognizing linear systems with certain integrality properties
• scientific article; zbMATH DE number 1801377
• The structure of an integral monoid and integer programming feasibility
• Using matching to detect infeasibility of some integer programs

Cited in

(1)

• Segments in enumerating faces

This page was built for publication: Intermediate feasibility in 0–1 integer linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716812)