Integer Programming, Constraint Programming, and their Combination
|
|
- Harvey Watson
- 5 years ago
- Views:
Transcription
1 Integer Programming, Constraint Programming, and their Combination Alexander Bockmayr Freie Universität Berlin & DFG Research Center Matheon Eindhoven, 27 January 2006
2 Discrete Optimization General framework Discrete variables x 1,..., x n, with x i D i Z Constraints c 1,..., c m D 1 D n constraint satisfaction Objective function f : D 1 D n R optimization Application areas Operations Research : Planning, scheduling, transportation,... Computational biology : Alignment, folding,... Generic solution approaches Integer linear programming IP Finite domain constraint programming CP 1
3 Outline 1. IP vs. CP Model building language Model solving algorithms 2. An illustrating example Discrete tomography IP vs. CP models 3. Combining IP and CP Cut generation for IP using CP SCIL, SCIP,... 2
4 1. Integer vs. Constraint Programming 3
5 IP vs. CP : Language IP CP Variables 0-1 Finite domain Constraints Linear equations Arithmetic constraints and inequalities Symbolic/global constraints Example Variables : x 1,..., x n {0,..., m 1} Constraint : Pairwise different values 4
6 Integer programming: Only linear equations and inequalities x i x j x i < x j x i > x j x i x j 1 x i x j + 1 Eliminating disjunction x i x j + 1 my i, x j x i + 1 my j, y i + y j = 1, y i, y j {0, 1}, 0 x i, x j m 1, New variables: z ik = 1 iff x i = k, i = 1,..., n, k = 0,..., m 1 z i0 + + z im 1 = 1, z 1k + + z nk 1, Constraint programming symbolic constraint alldifferent(x 1,..., x n ) 5
7 Symbolic Constraints alldifferent([x 1,..., x n ]) cumulative([s 1,..., s n ], [d 1,..., d n ], [r 1,..., r n ], c, e). n tasks with starting time s i, duration d i, resource demand r i resource capacity c, completion time e B C 2 C 2 1 A 1 A B 1 A B C cumulative([1,2,4], [4,2,2], [1,2,2],3,5) cumulative([1,2,2], [1,1,1], [2,1,2],3,2) cumulative([1,3,5], [2,1,1], [1,1,1],1,4) 6
8 Diffn Constraint Beldiceanu/Contejean 94 Nonoverlapping of n-dimensional rectangles [O 1,..., O n, L 1,..., L n ], where O i resp. L i denotes the origin resp. length in dimension i diffn([[o 11,..., O 1n, L 11,..., L 1n ],..., [O m1,..., O mn, L m1,..., L mn ]]) diffn([[1,2,2,2],[3,1,2,1],[4,2,3,3]]) General form: diffn(rectangles,min_vol,max_vol,end,distances,regions) 7
9 IP vs. CP : Algorithms IP CP Inference Linear programming Domain filtering Cutting planes Constraint propagation Search Branch-and-relax Branch-and-bound Branch-and-cut Bounds on the Two-sided One-sided objective function 8
10 Local vs. Global Reasoning Linear arithmetic constraints 3 x + y 7, 3 y + x 7, x + y = z, x, y {0,..., 3} CP (Filtering) : x, y 2, z 4 LP (Linear programming) : x, y 2, z 3.5 IP (Cutting plane) : x, y 2, z 3 Global reasoning in CP? global constraints y x 9
11 Global Reasoning in CP Example x 1, x 2, x 3 {0, 1} pairwise different values Local consistency : 3 disequalities : x 1 x 2, x 1 x 3, x 2 x 3 x 1, x 2, x 3 {0, 1}, i.e. no domain reduction is possible Global constraint : alldifferent(x 1, x 2, x 3 ) detects infeasibility (uses bipartite matching) Global reasoning in CP : inside global constraints Use domain-specific algorithms within a general solver 10
12 2. IP vs. CP : An Illustrating Example 11
13 Discrete Tomography Bockmayr/Kasper/Zajac 98 Binary matrix with m rows and n columns Horizontal projection numbers (h 1,..., h m ) Vertical projection numbers (v 1,..., v n ) Properties Horizontal convexity (h) Vertical convexity (v) Connectivity (polyomino) (p) Complexity (Woeginger 01) H V polynomial: ( ), (p,v,h) NP-complete: (p,v), (p,h), (v,h), (v), (h), (p) 12
14 IP Model Variables x ij = { 0 cell(i,j) is labeled white 1 cell(i,j) is labeled black Constraints I: Projections n x ij = h i, j=1 m x ij = v j i=1 Constraints II: Convexity hi= 3 x ik x i(k+3) h i x ik + n l=k+h i x il h i, v j x kj + m l=k+v j x lj v j, 13
15 IP Model (contd) Constraints III: Connectivity j+h i 1 k=j x ik j+h i 1 k=j x (i+1)k h i 1 hi= 4 h i+1 =3 x i2 Various linear arithmetic models possible, e.g. convexity Enormous differences in size and running time, e.g. 1 day vs. < 1 sec Large number of constraints ( 3mn in the above model) 14
16 Finite Domain Model Variables x i start of the horizontal convex block in row i, for 1 i m y j start of the vertical convex block in column j, for 1 j n Domain H 2 Y V x i [1,..., n h i + 1], for 1 i m y j [1,..., m v j + 1], for 1 j n X
17 Conditional Propagation Projection/Convexity modelled by FD variables Compatibility of x i and y j x i j < x i + h i y j i < y j + v j for 1 i m and 1 j n row i Conditional propagation if x i j then (if j < x i + h i then (y j i, i < y j + v j )) 16
18 Finite Domain Model (contd) Connectivity row i row i+1 1 x i x i + h i -1 n 1 n x i+1 + h i+1-1 x i+1 Block i must start before the end of block i + 1 x i x i+1 + h i+1 1, for 1 i m 1 Block i + 1 must start before the end of block i x i+1 x i + h i 1, for 1 i m 1 17
19 Cumulative
20 2d and 3d Diffn Model
21 3. Combining IP and CP 20
22 Generic MIP/CP Model Bockmayr/Pisaruk 03 max cx + dz, (1) Ax + Gz b, (2) F i (x i ) = 0, i = 1,..., m, (3) l x u, x Z n, l z u, z R p, (4) where x i = (x i1,..., x ik(i) ) consists of some components of x = (x 1,..., x n ), and F i : Z k(i) {0, 1} is monotone, i.e., x y F (x) F (y). 21
23 Monotone constraints Let x, y [l, u] with F (x) = 0 and F (y) = 1. For F : [l, u] {0, 1} monotone, we cannot have y x. Therefore (x 1 y 1 1) (x 2 y 2 1)... (x n y n 1) (5) If y i = l i y i = u i, for i = 1,..., n, then (5) is equivalent to x i ( i:y i >l i i:y i >l i y i ) 1 (6) In general, inequality (6) is stronger than the disjunction (5). 22
24 Binary Case If [l, u] = {0, 1} n, then (6) and (5) are equivalent. (6) can be rewritten as the cardinality inequality x i S(y) 1, (7) i S(y) where S(y) = {j : y j 0} denotes the support of the vector y. It follows F 1 (0) = {x {0, 1} n : F (x) = 0} (8) = {x {0, 1} n : x i S(y) 1, y F 1 (1)}, (9) i S(y) 23
25 Heuristic Separation Separate x [0, 1] n from conv(f 1 (0)) 1. Sort components of x in nondecreasing order: x π(1)... x π(n). 2. Let r {1,..., n} be the largest index such that r { j=1 xi π(j) > r Obtain a 0-1 vector y {0, 1} n 1, if 1 j r, by y π(j) = 0, if r + 1 j n. 4. If F (y) = 1, the inequality r j=1 x π(j) r 1 separates x from conv(f 1 (0)). The procedure may fail to separate x from conv(f 1 (0)) even if x conv(f 1 (0)). However, it always separates infeasible integral points. 24
26 IP/CP Branch and Cut Start with the IP program (1), (2), and (4). Assume x has to be tested for feasibility (when solving some LP subproblem). For i = 1,..., m, use the heuristic together with CP algorithms to separate x i from conv(f 1 i (0)). Since the heuristic always separates infeasible integer points, the output is an optimal feasible solution to problem (1) (4) (if it exists). 25
27 Multiple Machine Scheduling Problem Jain/Grossmann 01 n tasks, m dissimilar machines. any task can be processed on any machine. processing cost c ij and processing time p ij for task i on machine j r i release date, d i due date of task i. carry out all the tasks at the least possible cost. Main decisions 1. Assignment of tasks to machines. 2. Sequencing of tasks on each machine, and starting time for each task. 26
28 Combined IP/CP Model x ij = 1 if task i is assigned to machine j, x ij = 0 otherwise. F j (x j ) = 0 if the tasks in S(x j ) can be done on machine j respecting release and due dates. min n i=1 m j=1 c ijx ij m j=1 x ij = 1, i = 1,..., n, m j=1 p ijx ij d i r i, i = 1,..., n, n i=1 p ijx ij max 1 i n d i min 1 i n r i, j = 1,..., m, F j (x 1j,..., x nj ) = 0, j = 1,..., m, x ij {0, 1}, i = 1,..., n; j = 1,..., m. 27
29 Testing Feasibility by CP Handle F j (x j ) = 0 by solving a CP program with a single global constraint. Let D j (x j ) = max i S(x j ) d i, and assume S(x j ) = {s 1,..., s k }, k = S(x j ). Then F j (x j ) = 0 iff the CP problem t si [r si, d si p si,j], i = 1,..., k, cumulative([[t s1, p s1,j, 1],..., [t sk, p sk,j, 1]], 1, D j (x j )) has a solution. Computational results: Bockmayr/Pisaruk 03 Further applications: Supply chain optimization (LISCOS) 28
30 Conclusion IP and CP Model building: Language Model solving: Algorithms Case study: Discrete tomography Combining IP and CP: Cut generation for IP using CP 29
31 References A. Bockmayr and J. N. Hooker: Constraint programming. In Handbooks in Operations Research and Management Science. Vol. 12: Discrete Optimization (Eds. K. Aardal, G. Nemhauser, and R. Weismantel), Chapter 10, , Elsevier, A. Bockmayr and N. Pisaruk: Detecting Infeasibility and Generating Cuts for MIP using CP. 5th International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 03, Montreal, Revised version to appear in Computers & Operations Research 30
Integer vs. constraint programming. IP vs. CP: Language
Discrete Math for Bioinformatics WS 0/, by A. Bockmayr/K. Reinert,. Januar 0, 0:6 00 Integer vs. constraint programming Practical Problem Solving Model building: Language Model solving: Algorithms IP vs.
More informationAn Integrated Approach to Truss Structure Design
Slide 1 An Integrated Approach to Truss Structure Design J. N. Hooker Tallys Yunes CPAIOR Workshop on Hybrid Methods for Nonlinear Combinatorial Problems Bologna, June 2010 How to Solve Nonlinear Combinatorial
More informationarxiv:cs/ v2 [cs.dm] 21 Aug 2001
Solving Assembly Line Balancing Problems by Combining IP and CP Alexander Bockmayr and Nicolai Pisaruk arxiv:cs/0106002v2 [cs.dm] 21 Aug 2001 Université Henri Poincaré, LORIA B.P. 239, F-54506 Vandœuvre-lès-Nancy,
More informationDecision Diagrams for Discrete Optimization
Decision Diagrams for Discrete Optimization Willem Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Acknowledgments: David Bergman, Andre Cire, Samid
More informationScheduling with Constraint Programming. Job Shop Cumulative Job Shop
Scheduling with Constraint Programming Job Shop Cumulative Job Shop CP vs MIP: Task Sequencing We need to sequence a set of tasks on a machine Each task i has a specific fixed processing time p i Each
More information5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1
5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Definition: An Integer Linear Programming problem is an optimization problem of the form (ILP) min
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationPlanning and Optimization
Planning and Optimization C23. Linear & Integer Programming Malte Helmert and Gabriele Röger Universität Basel December 1, 2016 Examples Linear Program: Example Maximization Problem Example maximize 2x
More informationExtended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications
Extended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications François Vanderbeck University of Bordeaux INRIA Bordeaux-Sud-Ouest part : Defining Extended Formulations
More informationMixed Integer Programming Solvers: from Where to Where. Andrea Lodi University of Bologna, Italy
Mixed Integer Programming Solvers: from Where to Where Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it November 30, 2011 @ Explanatory Workshop on Locational Analysis, Sevilla A. Lodi, MIP
More informationDecision Diagrams for Sequencing and Scheduling
Decision Diagrams for Sequencing and Scheduling Willem-Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Plan What can MDDs do for Combinatorial Optimization?
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationCutting Plane Separators in SCIP
Cutting Plane Separators in SCIP Kati Wolter Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies 1 / 36 General Cutting Plane Method MIP min{c T x : x X MIP }, X MIP := {x
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective 1 / 24 Cutting stock problem 2 / 24 Problem description
More informationDecision Diagrams: Tutorial
Decision Diagrams: Tutorial John Hooker Carnegie Mellon University CP Summer School Cork, Ireland, June 2016 Decision Diagrams Used in computer science and AI for decades Logic circuit design Product configuration
More informationThe core of solving constraint problems using Constraint Programming (CP), with emphasis on:
What is it about? l Theory The core of solving constraint problems using Constraint Programming (CP), with emphasis on: l Modeling l Solving: Local consistency and propagation; Backtracking search + heuristics.
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective Vehicle routing problem 1 / 33 Cutting stock
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More informationResource Constrained Project Scheduling Linear and Integer Programming (1)
DM204, 2010 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Resource Constrained Project Linear and Integer Programming (1) Marco Chiarandini Department of Mathematics & Computer Science University of Southern
More informationProjection in Logic, CP, and Optimization
Projection in Logic, CP, and Optimization John Hooker Carnegie Mellon University Workshop on Logic and Search Melbourne, 2017 Projection as a Unifying Concept Projection is a fundamental concept in logic,
More informationThe use of predicates to state constraints in Constraint Satisfaction is explained. If, as an
of Constraint Satisfaction in Integer Programming H.P. Williams Hong Yan Faculty of Mathematical Studies, University of Southampton, Southampton, UK Department of Management, The Hong Kong Polytechnic
More informationSolving Mixed-Integer Nonlinear Programs
Solving Mixed-Integer Nonlinear Programs (with SCIP) Ambros M. Gleixner Zuse Institute Berlin MATHEON Berlin Mathematical School 5th Porto Meeting on Mathematics for Industry, April 10 11, 2014, Porto
More informationis called an integer programming (IP) problem. model is called a mixed integer programming (MIP)
INTEGER PROGRAMMING Integer Programming g In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More informationNetwork Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 6. Lagrangian Relaxation 6.3 Lagrangian Relaxation and Integer Programming Fall 2010 Instructor: Dr. Masoud Yaghini Integer Programming Outline Branch-and-Bound Technique
More informationAn Integrated Method for Planning and Scheduling to Minimize Tardiness
An Integrated Method for Planning and Scheduling to Minimize Tardiness J N Hooker Carnegie Mellon University john@hookerteppercmuedu Abstract We combine mixed integer linear programming (MILP) and constraint
More informationInteger Programming Part II
Be the first in your neighborhood to master this delightful little algorithm. Integer Programming Part II The Branch and Bound Algorithm learn about fathoming, bounding, branching, pruning, and much more!
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock, crew scheduling, vehicle
More informationAnalyzing the computational impact of individual MINLP solver components
Analyzing the computational impact of individual MINLP solver components Ambros M. Gleixner joint work with Stefan Vigerske Zuse Institute Berlin MATHEON Berlin Mathematical School MINLP 2014, June 4,
More informationProjection, Inference, and Consistency
Projection, Inference, and Consistency John Hooker Carnegie Mellon University IJCAI 2016, New York City A high-level presentation. Don t worry about the details. 2 Projection as a Unifying Concept Projection
More informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
More informationRepresentations of All Solutions of Boolean Programming Problems
Representations of All Solutions of Boolean Programming Problems Utz-Uwe Haus and Carla Michini Institute for Operations Research Department of Mathematics ETH Zurich Rämistr. 101, 8092 Zürich, Switzerland
More informationDecomposition-based Methods for Large-scale Discrete Optimization p.1
Decomposition-based Methods for Large-scale Discrete Optimization Matthew V Galati Ted K Ralphs Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA, USA Départment de Mathématiques
More informationA Scheme for Integrated Optimization
A Scheme for Integrated Optimization John Hooker ZIB November 2009 Slide 1 Outline Overview of integrated methods A taste of the underlying theory Eamples, with results from SIMPL Proposal for SCIP/SIMPL
More informationCutting Planes in SCIP
Cutting Planes in SCIP Kati Wolter Zuse-Institute Berlin Department Optimization Berlin, 6th June 2007 Outline 1 Cutting Planes in SCIP 2 Cutting Planes for the 0-1 Knapsack Problem 2.1 Cover Cuts 2.2
More informationIntroduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 21 Dr. Ted Ralphs IE406 Lecture 21 1 Reading for This Lecture Bertsimas Sections 10.2, 10.3, 11.1, 11.2 IE406 Lecture 21 2 Branch and Bound Branch
More informationIntroduction to Integer Linear Programming
Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.
More informationInteger Programming. Wolfram Wiesemann. December 6, 2007
Integer Programming Wolfram Wiesemann December 6, 2007 Contents of this Lecture Revision: Mixed Integer Programming Problems Branch & Bound Algorithms: The Big Picture Solving MIP s: Complete Enumeration
More informationDecision Procedures An Algorithmic Point of View
An Algorithmic Point of View ILP References: Integer Programming / Laurence Wolsey Deciding ILPs with Branch & Bound Intro. To mathematical programming / Hillier, Lieberman Daniel Kroening and Ofer Strichman
More informationInteger Linear Programming (ILP)
Integer Linear Programming (ILP) Zdeněk Hanzálek, Přemysl Šůcha hanzalek@fel.cvut.cz CTU in Prague March 8, 2017 Z. Hanzálek (CTU) Integer Linear Programming (ILP) March 8, 2017 1 / 43 Table of contents
More informationLinear integer programming and its application
Linear integer programming and its application Presented by Dr. Sasthi C. Ghosh Associate Professor Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata, India Outline Introduction
More information0-1 Reformulations of the Network Loading Problem
0-1 Reformulations of the Network Loading Problem Antonio Frangioni 1 frangio@di.unipi.it Bernard Gendron 2 bernard@crt.umontreal.ca 1 Dipartimento di Informatica Università di Pisa Via Buonarroti, 2 56127
More information3.7 Cutting plane methods
3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x
More informationStructured Problems and Algorithms
Integer and quadratic optimization problems Dept. of Engg. and Comp. Sci., Univ. of Cal., Davis Aug. 13, 2010 Table of contents Outline 1 2 3 Benefits of Structured Problems Optimization problems may become
More informationOperations Research Lecture 6: Integer Programming
Operations Research Lecture 6: Integer Programming Notes taken by Kaiquan Xu@Business School, Nanjing University May 12th 2016 1 Integer programming (IP) formulations The integer programming (IP) is the
More informationSection Notes 9. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
More informationInteger Programming ISE 418. Lecture 16. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 16 Dr. Ted Ralphs ISE 418 Lecture 16 1 Reading for This Lecture Wolsey, Chapters 10 and 11 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.3.7, II.5.4 CCZ Chapter 8
More informationStochastic Decision Diagrams
Stochastic Decision Diagrams John Hooker CORS/INFORMS Montréal June 2015 Objective Relaxed decision diagrams provide an generalpurpose method for discrete optimization. When the problem has a dynamic programming
More informationAlternative Methods for Obtaining. Optimization Bounds. AFOSR Program Review, April Carnegie Mellon University. Grant FA
Alternative Methods for Obtaining Optimization Bounds J. N. Hooker Carnegie Mellon University AFOSR Program Review, April 2012 Grant FA9550-11-1-0180 Integrating OR and CP/AI Early support by AFOSR First
More informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
More informationConstraint Programming Overview based on Examples
DM841 Discrete Optimization Part I Lecture 2 Constraint Programming Overview based on Examples Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. An
More informationLessons from MIP Search. John Hooker Carnegie Mellon University November 2009
Lessons from MIP Search John Hooker Carnegie Mellon University November 2009 Outline MIP search The main ideas Duality and nogoods From MIP to AI (and back) Binary decision diagrams From MIP to constraint
More informationProjection, Consistency, and George Boole
Projection, Consistency, and George Boole John Hooker Carnegie Mellon University CP 2015, Cork, Ireland Projection as a Unifying Concept Projection underlies both optimization and logical inference. Optimization
More informationSOLVING FINITE-DOMAIN LINEAR CONSTRAINTS IN PRESENCE OF THE ALLDIFFERENT
Logical Methods in Computer Science Vol. 12(3:5)2016, pp. 1 28 www.lmcs-online.org Submitted Jul. 31, 2015 Published Sep. 5, 2016 SOLVING FINITE-DOMAIN LINEAR CONSTRAINTS IN PRESENCE OF THE ALLDIFFERENT
More informationWhat is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t.
Modelling with Integer Variables jesla@mandtudk Department of Management Engineering Technical University of Denmark What is an integer program? Let us start with a linear program: st Ax b x 0 where A
More informationReconnect 04 Introduction to Integer Programming
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, Reconnect 04 Introduction to Integer Programming Cynthia Phillips, Sandia National Laboratories Integer programming
More informationCHAPTER 3: INTEGER PROGRAMMING
CHAPTER 3: INTEGER PROGRAMMING Overview To this point, we have considered optimization problems with continuous design variables. That is, the design variables can take any value within a continuous feasible
More informationPART 4 INTEGER PROGRAMMING
PART 4 INTEGER PROGRAMMING 102 Read Chapters 11 and 12 in textbook 103 A capital budgeting problem We want to invest $19 000 Four investment opportunities which cannot be split (take it or leave it) 1.
More informationFrom structures to heuristics to global solvers
From structures to heuristics to global solvers Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies OR2013, 04/Sep/13, Rotterdam Outline From structures to
More informationSequential pairing of mixed integer inequalities
Sequential pairing of mixed integer inequalities Yongpei Guan, Shabbir Ahmed, George L. Nemhauser School of Industrial & Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta,
More informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making (discrete optimization) problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock,
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationEvent-based MIP models for the resource constrained project scheduling problem
Event-based MIP models for the resource constrained project scheduling problem Oumar Koné, Christian Artigues, Pierre Lopez LAAS-CNRS, Université de Toulouse, France Marcel Mongeau IMT, Université de Toulouse,
More informationarxiv: v1 [cs.cc] 5 Dec 2018
Consistency for 0 1 Programming Danial Davarnia 1 and J. N. Hooker 2 1 Iowa state University davarnia@iastate.edu 2 Carnegie Mellon University jh38@andrew.cmu.edu arxiv:1812.02215v1 [cs.cc] 5 Dec 2018
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationEasy and not so easy multifacility location problems... (In 20 minutes.)
Easy and not so easy multifacility location problems... (In 20 minutes.) MINLP 2014 Pittsburgh, June 2014 Justo Puerto Institute of Mathematics (IMUS) Universidad de Sevilla Outline 1 Introduction (In
More informationOutline. Outline. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Scheduling CPM/PERT Resource Constrained Project Scheduling Model
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 and Mixed Integer Programg Marco Chiarandini 1. Resource Constrained Project Model 2. Mathematical Programg 2 Outline Outline 1. Resource Constrained
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More informationA Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows
A Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows Philipp Hungerländer Christian Truden 5th January 2017 Abstract In this extended abstract we introduce the
More informationInteger Linear Programming Modeling
DM554/DM545 Linear and Lecture 9 Integer Linear Programming Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. Assignment Problem Knapsack Problem
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo
More informationLecture 23 Branch-and-Bound Algorithm. November 3, 2009
Branch-and-Bound Algorithm November 3, 2009 Outline Lecture 23 Modeling aspect: Either-Or requirement Special ILPs: Totally unimodular matrices Branch-and-Bound Algorithm Underlying idea Terminology Formal
More informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationValid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints
Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints Nilay Noyan Andrzej Ruszczyński March 21, 2006 Abstract Stochastic dominance relations
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 18
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 18 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 31, 2012 Andre Tkacenko
More informationIntroduction into Vehicle Routing Problems and other basic mixed-integer problems
Introduction into Vehicle Routing Problems and other basic mixed-integer problems Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability and Mathematical
More informationDAA Unit- II Greedy and Dynamic Programming. By Mrs. B.A. Khivsara Asst. Professor Department of Computer Engineering SNJB s KBJ COE, Chandwad
DAA Unit- II Greedy and Dynamic Programming By Mrs. B.A. Khivsara Asst. Professor Department of Computer Engineering SNJB s KBJ COE, Chandwad 1 Greedy Method 2 Greedy Method Greedy Principal: are typically
More information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More informationColumn Generation. i = 1,, 255;
Column Generation The idea of the column generation can be motivated by the trim-loss problem: We receive an order to cut 50 pieces of.5-meter (pipe) segments, 250 pieces of 2-meter segments, and 200 pieces
More informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationClassification of Dantzig-Wolfe Reformulations for MIP s
Classification of Dantzig-Wolfe Reformulations for MIP s Raf Jans Rotterdam School of Management HEC Montreal Workshop on Column Generation Aussois, June 2008 Outline and Motivation Dantzig-Wolfe reformulation
More informationConsistency as Projection
Consistency as Projection John Hooker Carnegie Mellon University INFORMS 2015, Philadelphia USA Consistency as Projection Reconceive consistency in constraint programming as a form of projection. For eample,
More informationSingle-Facility Scheduling by Logic-Based Benders Decomposition
Single-Facility Scheduling by Logic-Based Benders Decomposition Elvin Coban J. N. Hooker Tepper School of Business Carnegie Mellon University ecoban@andrew.cmu.edu john@hooker.tepper.cmu.edu September
More informationSymmetry Breaking Ordering Constraints
Symmetry Breaking Ordering Constraints PhD dissertation Uppsala University, Sweden, March 2004 Zeynep KIZILTAN Università di Bologna, Italy URL: http://lia.deis.unibo.it/~zk/ Overview Brief Background
More informationSeparation Techniques for Constrained Nonlinear 0 1 Programming
Separation Techniques for Constrained Nonlinear 0 1 Programming Christoph Buchheim Computer Science Department, University of Cologne and DEIS, University of Bologna MIP 2008, Columbia University, New
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationSolving LP and MIP Models with Piecewise Linear Objective Functions
Solving LP and MIP Models with Piecewise Linear Obective Functions Zonghao Gu Gurobi Optimization Inc. Columbus, July 23, 2014 Overview } Introduction } Piecewise linear (PWL) function Convex and convex
More informationProbabilistic Graphical Models
Probabilistic Graphical Models David Sontag New York University Lecture 6, March 7, 2013 David Sontag (NYU) Graphical Models Lecture 6, March 7, 2013 1 / 25 Today s lecture 1 Dual decomposition 2 MAP inference
More informationOn the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times
CORE DISCUSSION PAPER 2000/52 On the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times Andrew J. Miller 1, George L. Nemhauser 2, and Martin W.P. Savelsbergh 2 November 2000
More informationto work with) can be solved by solving their LP relaxations with the Simplex method I Cutting plane algorithms, e.g., Gomory s fractional cutting
Summary so far z =max{c T x : Ax apple b, x 2 Z n +} I Modeling with IP (and MIP, and BIP) problems I Formulation for a discrete set that is a feasible region of an IP I Alternative formulations for the
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 24: Discrete Optimization
15.081J/6.251J Introduction to Mathematical Programming Lecture 24: Discrete Optimization 1 Outline Modeling with integer variables Slide 1 What is a good formulation? Theme: The Power of Formulations
More informationTotally unimodular matrices. Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems
Totally unimodular matrices Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems Martin Branda Charles University in Prague Faculty of Mathematics and
More informationIntroduction to optimization and operations research
Introduction to optimization and operations research David Pisinger, Fall 2002 1 Smoked ham (Chvatal 1.6, adapted from Greene et al. (1957)) A meat packing plant produces 480 hams, 400 pork bellies, and
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationCombinatorial optimization problems
Combinatorial optimization problems Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Optimization In general an optimization problem can be formulated as:
More informationGeometric Steiner Trees
Geometric Steiner Trees From the book: Optimal Interconnection Trees in the Plane By Marcus Brazil and Martin Zachariasen Part 3: Computational Complexity and the Steiner Tree Problem Marcus Brazil 2015
More informationA Global Constraint for Parallelizing the Execution of Task Sets in Non-Preemptive Scheduling
A Global Constraint for Parallelizing the Execution of Task Sets in Non-Preemptive Scheduling 1 Introduction Michael Marte 1 Institut für Informatik, Universität München Oettingenstr. 67, 80538 München,
More information