Cutting Plane Based Methods for Integer Programs

Sastry Trilochan

IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: We develop a general cutting plane based paradigm for three standard problems: lot-sizing, plant location and general network design, with and without capacity constraints. Other methods for solving these problems like branch and bound and Lagrangean relaxation have not performed well in all cases. We explore some theoretical and computational issues. These methods have wide ranging applications in road and rail transport network designs, irrigation systems and communication networks.

Date: 1991-10-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:wp01053

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().