A monotonic, dual-based bounding procedure for integer programs

This paper develops a simple, dual-based, and monotonic bounding procedure for solving integer linear programs. Although it is dual-based, it can be usefully applied for integer programs for which the LP relaxatyion yields good bounds but cannot be solved easily by direct methods. Preliminary result...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 1995-05, Vol.22 (5), p.491-501
1. Verfasser:	Sankaran, Jayaram K.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Decision analysis Exact sciences and technology Integer programming Mathematical programming Operational research and scientific management Operational research. Management science Operations research Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!