A Cutting Plane Algorithm for Integer Programs With an Easy Proof of Convergence

Bell, D.E. (1973) A Cutting Plane Algorithm for Integer Programs With an Easy Proof of Convergence. IIASA Working Paper. IIASA, Laxenburg, Austria, WP-73-015

[img]
Preview
Text
WP-73-015.pdf

Download (73kB) | Preview
Item Type: Monograph (IIASA Working Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:40
Last Modified: 08 Aug 2016 22:08
URI: http://pure.iiasa.ac.at/31

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313