Bell DE (1973). The Art of Integer Programming - Relaxation. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-73-008
Download (229kB) | Preview
When faced with a difficult problem, the integer programmer is apt to take the common approach of finding a related easier problem and solving that instead. In other disciplines this means approximating the data, making simplifying assumptions, etc.; in integer programming, the idea is to find a "relaxation" of the original problem.
This paper gives three examples of relaxations being used in integer programming.
|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:||18 Nov 2016 17:37|
Actions (login required)