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

[thumbnail of WP-73-015.pdf]
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: 27 Aug 2021 17:07
URI: https://pure.iiasa.ac.at/31

Actions (login required)

View Item View Item