Intermediate feasibility in 0–1 integer linear systems

The Intermediate Feasibility Property (IFP) is defined for 0–1 integer linear systems. It is shown that IFP holds for 1-matching/covering systems, but not in general. Complexity results are established for checking whether this property holds in other 0–1 systems.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Carstensen, Patricia J., Murty, Katta G., Perin, Clovis
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	0–1 Integer Linear System 1-Matching/Covering Problem Computational Complexity Intermediate Feasibility Property NP-Complete Problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The Intermediate Feasibility Property (IFP) is defined for 0–1 integer linear systems. It is shown that IFP holds for 1-matching/covering systems, but not in general. Complexity results are established for checking whether this property holds in other 0–1 systems.
ISSN:	0303-3929 2364-8201
DOI:	10.1007/BFb0121052