This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ILP Formulations Spanning Trees Cut ingplane separation kMST C/G Cut ing Planes ILP Formulation Properties and Strenghtening Techniques Version 2009.2 Andreas M. Chwatal Algorithms and Data Structures Group Institute of Computer Graphics and Algorithms Vienna University of Technology VU Fortgeschrittene Algorithmen und Datenstrukturen Mai 2009 1 ILP Formulations Spanning Trees Cut ingplane separation kMST C/G Cut ing Planes What is a strong/good (I)LP formulation? Linear program: low number of variables low number of constraints complexity grows polynomially in these entities Integer Linear Program: Let F = { x 1 ,..., x k } be an feasible integer solution to some ILP Convex hull conv ( F ) = k X i =1 i x i k X i =1 i = 1 , i Let P denote the polyhedron associated to the linear relaxation of the ILP: conv ( F ) P Optimal case: conv ( F ) = P , but this is often not achievable In a strong formulation P closely approximates conv ( F ) 2 ILP Formulations Spanning Trees Cut ingplane separation kMST C/G Cut ing Planes The pigeonhole Suppose, we want to place n +1 items into n holes, such that each hole contains exactly one item. (This is clearly infeasible) n X j =1 x ij = 1 , i = 1 ,..., n +1 (1a) x ij { , 1 } i = 1 ,..., n +1 , j = 1 ,..., n (1b) Two alternatives for the additional constraints: x ij + x kj 1 , j = 1 ,..., n , i 6 = k , i , k = 1 ,..., n +1 (2) n +1 X i =1 x ij 1 , j = 1 ,..., n (3) Linear relaxation of formulation with (2) is feasible (with x ij = 1 / n ), but infeasible with (3). 3 ILP Formulations Spanning Trees Cut ingplane separation kMST C/G Cut ing Planes Example: Facility Location Given: n potential facility locations with opening costs c j , m clients with service costs d ij (for client i from facility j ) Formulation 1: min n X j =1 c j y j + m X i =1 n X j =1 d ij x ij (4a) s . t . n X j =1 x ij = 1 for all i (4b) x ij y j for all i , j (4c) x ij 1 , y i { , 1 } for all i , j (4d) 4 ILP Formulations Spanning Trees Cut ingplane separation kMST C/G Cut ing Planes Facility Location (cont.) Formulation 2: min n X j =1 c j y j + m X i =1 n X j =1 d ij x ij (5a) s . t . n X j =1 x ij = 1 for all i (5b) m X i =1 x ij m y j for all j (5c) x ij 1 , y i { , 1 } for all i , j (5d) Which formulation is better? F1 has n + nm constraints, whereas F2 has n + m constraints But, P F 1 P F 2 !! (where P X denotes the polyhedron corresponding to the LP relaxation of formulation X ) 5 ILP Formulations Spanning Trees Cut ingplane separation kMST C/G Cut ing Planes Spanning Trees In this section we study various ST formulations. Why? Spanning tree (ST) problems arise in various contexts, often as subproblems to more complex problems....
View
Full
Document
This note was uploaded on 02/14/2012 for the course IE 530 taught by Professor Ravindran during the Spring '97 term at Purdue UniversityWest Lafayette.
 Spring '97
 RAVINDRAN

Click to edit the document details