Graph Coloring Facets from a Constraint Programming Formulation
|
|
- Abner Ralph Tate
- 5 years ago
- Views:
Transcription
1 Graph Coloring Facets from a Constraint Programming Formulation David Bergman J. N. Hooker Carnegie Mellon University INFORMS 2011
2 Motivation 0-1 variables often encode choices that can be represented with finite domain variables. x i = finite domain variable Job assigned to worker i Start time of job i City visited after city i Number of packages on truck i y ij = corresponding 0-1 variable y ij = 1 if x i = j
3 Motivation A constraint programming formulation often uses finite-domain variables. If the variables are numeric, the problem has polyhedral structure very different from the 0-1 problem. Finite-domain cuts can be mapped into the 0-1 model. This may yield stronger cuts in the 0-1 model.
4 Motivation A constraint programming formulation often uses finite-domain variables. If the variables are numeric, the problem has polyhedral structure very different from the 0-1 problem. Finite-domain cuts can be mapped into the 0-1 model. This may yield stronger cuts in the 0-1 model. We apply this idea to graph coloring. May apply to other problems with both 0-1 and CP formulations.
5 Motivation We obtain two kinds of results: If you find a structure (e.g., odd hole) that yields a known valid inequality in 0-1 space We will give you a stronger cut for free. Use whatever separation algorithm you want.
6 Motivation We obtain two kinds of results: If you find a structure (e.g., odd hole) that yields a known valid inequality in 0-1 space We will give you a stronger cut for free. Use whatever separation algorithm you want. We identify additional structures that yield valid inequalities. They are stronger than known cuts. We have separation algorithms.
7 Graph Coloring We focus on the vertex coloring problem. Given a graph, assign colors to vertices so that no two adjacent vertices receive the same color. Minimize the number of colors
8 Graph Coloring = 1 if color j is used 0-1 model min j ij j y + y w, all colors j 1j 2 j j y + y w, all colors j 1j 5 j j y + y w, all colors j 2 j 3 j j y + y + y w, all colors j y 3 j 4 j 5 j j ij y w { 0,1} j = 1, all vertices i = 1 if vertex i receives color j
9 Graph Coloring General model: min j i V y ij k y ij j w j = 1, all vertices y w, all colors j, cliques V that cover vertices ij j k { 0,1} = 1 if vertex i receives color j = 1 if color j is used i O(n 2 ) variables O(n 3 ) constraints
10 Alldiff Systems Use an all-different constraint for each clique min z x, all vertices i i ( x1 x2 ) ( x1 x5 ) ( 2 3 ) ( ) { 1,...,5 } alldiff,, all colors alldiff,, all colors alldiff x, x, all colors j alldiff x, x, x, all colors j x i z = color assigned to vertex i j j
11 Alldiff Systems General model: min z z x, all vertices i i ( ) { 1,, n} alldiff x i V, all cliques V x i i k k = color assigned to vertex i O(n) variables O(n 2 ) constraints Objective reduces symmetry
12 Alldiff Systems Applications: Scheduling, timetabling. Employee scheduling. Course timetabling. Latin squares. Alldiff for each row, column. Experimental design: orthogonal Latin squares. Sudoku puzzles. Graph coloring. Many applications.
13 Related Work Convex hull of single alldiff. Hooker (2000), Williams and Yan (2001). Convex hull of 2 alldiffs. Appa, Magos and Mourtos (2004) Convex hull of alldiff systems with inclusion property. Appa, Magos and Mourtos (2011). Same facets as individual alldiffs. Some facets of systems without inclusion property. Magos and Mourtos (2011).
14 Variable Mapping There is a linear mapping from x i to y ij : x i = Any valid linear inequality in x i -space maps to a valid linear inequality in y ij -space. Just substitute above expression for x i. j Convert any finite domain cut to a 0-1 cut. jy ij
15 Variable Mapping There is a linear mapping from x i to y ij : x i = Any valid linear inequality in x i -space maps to a valid linear inequality in y ij -space. Just substitute above expression for x i. j Convert any finite domain cut to a 0-1 cut. jy Objective function more likely to be linear in y-space. ij For coloring, it is linear in both x-space and y-space.
16 Choice of Domain We will assume each x i has domain {0,, n 1}. To simplify exposition. Most results to follow can be generalized to an arbitrary numeric domain {v 1,, v n } with each v i 0. Some results are valid for domain D = {0,δ,, (n 1)δ} with δ > 0.
17 Odd Cycles A q-cycle consists of q alldiff constraints that look like this: alldiff x 1 x 2 x 11 alldiff x 17 x 10 x 9 x 3 x 4 x 12 alldiff x 16 x 8 x 13 alldiff x 15 x 7 x 14 alldiff x 6 x 5
18 Odd Cycles Select any subset of s vertices in each overlap: s = 2 S 1 x 1 x 2 x 11 S 5 x 17 x 10 x 9 x 3 x 4 x 12 x 16 S x 2 13 x 8 x 15 x 7 S 4 x 14 x 6 x 5 S 3
19 Odd Cycles Focus on the sets S i : S 1 s = 2 q = 5 S 5 x 10 x 9 x 1 x 2 x 3 x 4 S 2 S 4 x 8 x 7 sq = 10 vertices Each color can be assigned to at most (q 1)/2 = 2 vertices. x 6 x 5 S 3 sq We need at least L = = 5 colors ( q 1) / 2
20 So i S Focus on the sets S i : x i s = 2 q = 5 q 1 q sq = 10 vertices Each color can be assigned to at most (q 1)/2 = 2 vertices. S = k S Odd Cycles q 1 q 1 + ( L 2) + sq ( L 1) ( L 1) 2 2 k S 5 x 10 x 9 S 4 x 8 x 7 x 1 S 1 x 2 x 6 x 5 x 3 x 4 S 3 sq We need at least L = = 5 colors ( q 1) / 2 S 2
21 Odd Cycles Focus on the sets S i : S 1 So i S x i s = 2 q = 5 S = q 1 q k S q 1 q 1 + ( L 2) + sq ( L 1) ( L 1) 2 2 q 1 = sq L ( L 1) = 20 4 k S 5 x 10 x 9 S 4 x 8 x 7 x 1 x 2 x 6 x 5 x 3 x 4 S 3 S 2
22 Odd Cycles So we have a valid inequality: i S q 1 xi sq L ( L 1) = x 10 x 9 0 x 1 1 x 2 x 3 x x 8 x 7 x 6 x 5 0 4
23 Odd Cycles So we have a valid inequality: i S q 1 xi sq L ( L 1) = 20 4 The inequality is facetdefining if q is odd. and if the q-cycle is the subgraph induced by vertices in the cycle. 4 3 x 10 x x 8 x 7 0 x 1 1 x 2 x 3 x 4 x x
24 Odd Cycles So we have a valid inequality: i S q 1 xi sq L ( L 1) = 20 4 The inequality is facetdefining if q is odd. and if the q-cycle is the subgraph induced by vertices in the cycle. For s = 1, we have odd hole cut: q + 3 xi 2 i S 4 3 x 10 x x 8 x 7 0 x 1 1 x 2 x 3 x 4 x x
25 Odd Cycles So we have a valid inequality: i S q 1 xi sq L ( L 1) = 20 4 We can obtain a valid bound on number of colors z by substituting z x i for x i : 4 3 x 10 x 9 x 8 x 7 0 x 1 1 x 2 x 3 x q 1 x x 5 z x 1 ( 1) 6 i + L L 2 qs 4 4 i S qs = xi This is facet defining for domain D. i S
26 z-cuts in general In fact, facet-defining x-cuts for a graph coloring problem always give rise to facet-defining z-cuts: Theorem: if ax b is facet defining for a coloring problem with domain D = {0, δ, 2δ,, (n 1)δ} for δ > 0, then aez ax + b is also facet defining, where e = (1,, 1).
27 Mapping into 0-1 Space The x-cut i S q 1 xi sq L ( L 1) = 20 4 and the z-cut 1 q 1 z xi + 1 L ( L 1) qs i S 4qs 4 3 x 10 x 9 0 x 1 1 x 2 x 3 x map into a 0-1 cut by replacing x i with jy How do they compare with classical odd hole cuts? j ij 2 1 x 8 x 7 x x
28 Comparison with Odd Hole Cuts A q-cycle defines s q = 32 odd hole cuts for each color: q 1 yij w j, all T, j 2 i T where T selects one vertex from each S k S 5 x 10 x 9 x 1 S 1 x 2 x 3 x 4 S 2 S 4 x 8 x 7 x 6 x 5 S 3
29 Comparison with Odd Hole Cuts A q-cycle defines s q = 32 odd hole cuts for each color: q 1 yij w j, all T, j 2 i T where T selects one vertex from each S k For s 2, one x-cut is stronger than all of these odd hole cuts. S 5 x 10 x 9 S 4 For s = 1, the finite domain cut is redundant of odd cycle cuts and other 0-1 constraints. x 8 x 7 x 1 S 1 x 2 x 6 x 5 x 3 x 4 S 3 S 2
30 Comparison with Odd Hole Cuts A q-cycle defines s q = 32 odd hole cuts for each color: q 1 yij w j, all T, j 2 i T where T selects one vertex from each S k For s 2, one x-cut is stronger than all of these odd hole cuts. Adding a z-cut to the x-cut tightens the bound further. S 5 x 10 x 9 S 4 x 8 x 7 x 1 S 1 x 2 x 6 x 5 x 3 x 4 S 3 S 2
31 Comparison with Odd Hole Cuts A q-cycle defines s q = 32 odd hole cuts for each color: q 1 yij w j, all T, j 2 i T where T selects one vertex from each S k For any s (including s = 1), one x-cut and one z-cut are stronger than all of these odd hole cuts. S 5 x 10 x 9 S 4 x 8 x 7 x 1 S 1 x 2 x 6 x 5 x 3 x 4 S 3 S 2
32 Comparison with Odd Hole Cuts A q-cycle defines s q = 32 odd hole cuts for each color: q 1 yij w j, all T, j 2 i T where T selects one vertex from each S k For any s (including s = 1), one x-cut and one z-cut are stronger than all of these odd hole cuts. x 10 x 9 x 8 x 7 For any separating odd hole cut, replace it with x-cut and z-cut for s = 1 to get a stronger cut. S 5 S 4 x 1 S 1 x 2 x 6 x 5 x 3 x 4 S 3 S 2
33 Computed Bounds Lower bound on number of colors in 0-1 model of 5-cycle s = All odd hole cuts x-cut only z-cut only x and z-cut only
34 Separation Heuristic Select subset of s vertices in each overlap with smallest values in current relaxation: s = 2 S 1 x 1 x 2 x 11 S 5 x 17 x 10 x 9 x 3 x 4 x 12 x 16 S x 2 13 x 8 x 15 x 7 S 4 x 14 x 6 x 5 S 3
35 A q-path looks like Odd Paths alldiff alldiff alldiff alldiff alldiff x a x 1 x 2 x 3 x 4 x b q = 5 x 5 x 6 x 7 x 7
36 Select q + 1 variables: Odd Paths x a x 1 x 2 x 3 x 4 x b q = 5 x 5 x 6 x 7 x 7
37 Odd Paths This yields a valid inequality (x-cut) x a x 1 x 2 x 3 x 4 x b q = q 1 q + 3 2( x + x ) + x = 4 2 a b i i = 1
38 Odd Paths This yields a valid inequality (x-cut): x a x 1 x 2 x 3 x 4 x b q = q 1 q + 3 2( xa + xb ) + xi = 4 i = 1 2 The inequality is facet-defining if q is odd. and if the q-path is the subgraph induced by vertices in the cycle.
39 We also have a z-cut Odd Paths x a x 1 x 2 x 3 x 4 x b q = z x + x + x + q + q ( ) 3 a b i i = 1 2 This is also facet defining.
40 Mapping into 0-1 Space When mapped into 0-1 space, the finite domain cuts are redundant of the 0-1 model. Because the 0-1 model is already totally unimodular. This is also facet defining.
41 Mapping into 0-1 Space When mapped into 0-1 space, the finite domain cuts are redundant of the 0-1 model. Because the 0-1 model is already totally unimodular. However, the finite domain cuts provide a compact relaxation. For each q-path, replace q clique constraints with one x-cut and one y-cut. Gives the same bound in a problem consisting of one path.
42 Clutters A q-clutter looks something like V 2 S 3 S 1 T 2 T 3 U S 2 V 3 S = V \ V k l k T = V \ V k U = k k V k l l k k l T 1 q = 3 V 1
43 Clutters Facet-defining inequality. Let S = S T T u = U k k = k k V 2 q = 3 S 1 T 2 T 3 U S 3 T 1 V 1 S 2 V 3 q( q 1) qs + u xi + xi b 2 ( ) A valid inequality is: i T i S U where 1 b = q q 2 qs + u qs + u + ( 1)( )( 1) Properties of 0-1 mapping?
44 Another Interpretation Combine alternate formulations to obtain a better relaxation. Often done in constraint programming to obtain better propagation. x i = job assigned to worker i y j = worker assigned to job j Write each constraint in one or both variable systems. Add channeling constraints: x = j, all j y j y = i, all i x i
45 Another Interpretation We are doing the same with relaxations. x relaxation y relaxation min z z x, all i i i q 1 xi sq L L 4 ( 1) 1 q 1 z xi + 1 L L 1 qs i 4qs ( ) x i = j jy ij min j i V k y ij = 1, all i y w, all j, V 0 y 1 j j ij j k ij w channeling constraint
46 Another Interpretation Neither relaxation alone provides a good bound. 5-cycle problem with s = 2 Bound Odd hole cuts in y-relaxation 1.5 Finite domain cuts in x-relaxation 2.6 Combined models 4.0
47 Future Work Map other known finite-domain cuts into 0-1 models. What happens? Cardinality rules. Yan and Hooker (1999). Circuit constraint (TSP). Genc-Kaya and Hooker (2010). Cumulative constraint. Polyhedral analysis for other global constraints. General cardinality, nvalues, sequence, regular.
48 General Issues When do linked multiple relaxations provide better bounds than one relaxation? Can we say anything about the properties of different variable encodings? What are variables, and why do we use them?
5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
More informationTowards Efficient Higher-Order Semidefinite Relaxations for Max-Cut
Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut Miguel F. Anjos Professor and Canada Research Chair Director, Trottier Energy Institute Joint work with E. Adams (Poly Mtl), F. Rendl,
More informationPropagating Separable Equalities. in an MDD Store. Peter Tiedemann INFORMS John Hooker. Tarik Hadzic. Cork Constraint Computation Centre
Propagating Separable Equalities in an MDD Store Tarik Hadzic Cork Constraint Computation Centre John Hooker Carnegie Mellon University Peter Tiedemann Configit Software Slide 1 INFORMS 2008 Slide 2 Constraint
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationDiscrete Optimization with Decision Diagrams
Discrete Optimization with Decision Diagrams J. N. Hooker Joint work with David Bergman, André Ciré, Willem van Hoeve Carnegie Mellon University Australian OR Society, May 2014 Goal Find an alternative
More informationLATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS
LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS TIMOTHY L. VIS Abstract. A significant problem in finite optimization is the assignment problem. In essence, the assignment
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I Instructor: Shaddin Dughmi Announcements Posted solutions to HW1 Today: Combinatorial problems
More information2. Modeling AEA 2018/2019. Based on Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice - ch. 2
2. Modeling AEA 2018/2019 Based on Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice - ch. 2 Content Introduction Modeling phases Modeling Frameworks Graph Based Models Mixed
More information15.082J and 6.855J. Lagrangian Relaxation 2 Algorithms Application to LPs
15.082J and 6.855J Lagrangian Relaxation 2 Algorithms Application to LPs 1 The Constrained Shortest Path Problem (1,10) 2 (1,1) 4 (2,3) (1,7) 1 (10,3) (1,2) (10,1) (5,7) 3 (12,3) 5 (2,2) 6 Find the shortest
More informationFrom final point cuts to!-polyhedral cuts
AUSSOIS 2017 From final point cuts to!-polyhedral cuts Egon Balas, Aleksandr M. Kazachkov, François Margot Tepper School of Business, Carnegie Mellon University Overview Background Generalized intersection
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationConstraint Programming. Global Constraints. Amira Zaki Prof. Dr. Thom Frühwirth. University of Ulm WS 2012/2013
Global Constraints Amira Zaki Prof. Dr. Thom Frühwirth University of Ulm WS 2012/2013 Amira Zaki & Thom Frühwirth University of Ulm Page 1 WS 2012/2013 Overview Classes of Constraints Global Constraints
More informationInteger Programming as Projection
Integer Programming as Projection H. P. Williams London School of Economics John Hooker Carnegie Mellon University INFORMS 2015, Philadelphia USA A Different Perspective on IP Projection of an IP onto
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationConstraint Satisfaction Problems. slides from: Padhraic Smyth, Bryan Low, S. Russell and P. Norvig, Jean-Claude Latombe
Constraint Satisfaction Problems slides from: Padhraic Smyth, Bryan Low, S. Russell and P. Norvig, Jean-Claude Latombe Standard search problems: State is a black box : arbitrary data structure Goal test
More informationval(y, I) α (9.0.2) α (9.0.3)
CS787: Advanced Algorithms Lecture 9: Approximation Algorithms In this lecture we will discuss some NP-complete optimization problems and give algorithms for solving them that produce a nearly optimal,
More informationLecture 3: Totally Unimodularity and Network Flows
Lecture 3: Totally Unimodularity and Network Flows (3 units) Outline Properties of Easy Problems Totally Unimodular Matrix Minimum Cost Network Flows Dijkstra Algorithm for Shortest Path Problem Ford-Fulkerson
More informationGraphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University
Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial
More informationLecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming
More informationDecomposition in Integer Linear Programming
Decomposition in Integer Linear Programming T.K. Ralphs M.V. Galati December 3, 00 Abstract Both cutting plane methods and traditional decomposition methods are procedures that compute a bound on the optimal
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] What is Search
More informationCOMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2)
COMP331/557 Chapter 2: The Geometry of Linear Programming (Bertsimas & Tsitsiklis, Chapter 2) 49 Polyhedra and Polytopes Definition 2.1. Let A 2 R m n and b 2 R m. a set {x 2 R n A x b} is called polyhedron
More informationIndex. optimal package assignments, 143 optimal package assignments, symmetrybreaking,
A Abstract approach, 79 Amphibian coexistence aquarium, 7 executes, 16 model, 13 15 modeling languages, 11 12 MPSolver, 12 OR-Tools library, 12 preys, 7 run a model, 17 18 solution, 17 three-step approach,
More informationLecture outline. Graph coloring Examples Applications Algorithms
Lecture outline Graph coloring Examples Applications Algorithms Graph coloring Adjacent nodes must have different colors. How many colors do we need? Graph coloring Neighbors must have different colors
More informationRigidity, connectivity and graph decompositions
First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationWhat is Search For? CS 188: Artificial Intelligence. Constraint Satisfaction Problems
CS 188: Artificial Intelligence Constraint Satisfaction Problems What is Search For? Assumptions about the world: a single agent, deterministic actions, fully observed state, discrete state space Planning:
More informationCombinatorial Optimization
Combinatorial Optimization MA4502 Michael Ritter This work is licensed under a Creative Commons Attribution- ShareAlike 4.0 International license. last updated July 14, 2015 Contents 1 Introduction and
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationDecomposition in Integer Linear Programming
Decomposition in Integer Linear Programming M.V. Galati Advanced Analytics - Operations R & D, SAS Institute, Chesterbrook, PA 9 Ted K. Ralphs Department of Industrial and System Engineering, Lehigh University,
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationA Generic Separation Algorithm and Its Application to the Vehicle Routing Problem
A Generic Separation Algorithm and Its Application to the Vehicle Routing Problem Presented by: Ted Ralphs Joint work with: Leo Kopman Les Trotter Bill Pulleyblank 1 Outline of Talk Introduction Description
More informationSolutions to Assignment# 4
Solutions to Assignment# 4 Liana Yepremyan 1 Nov.12: Text p. 651 problem 1 Solution: (a) One example is the following. Consider the instance K = 2 and W = {1, 2, 1, 2}. The greedy algorithm would load
More informationResearch Question Presentation on the Edge Clique Covers of a Complete Multipartite Graph. Nechama Florans. Mentor: Dr. Boram Park
Research Question Presentation on the Edge Clique Covers of a Complete Multipartite Graph Nechama Florans Mentor: Dr. Boram Park G: V 5 Vertex Clique Covers and Edge Clique Covers: Suppose we have a graph
More informationAlgorithms for Decision Support. Integer linear programming models
Algorithms for Decision Support Integer linear programming models 1 People with reduced mobility (PRM) require assistance when travelling through the airport http://www.schiphol.nl/travellers/atschiphol/informationforpassengerswithreducedmobility.htm
More informationThe ILP approach to the layered graph drawing. Ago Kuusik
The ILP approach to the layered graph drawing Ago Kuusik Veskisilla Teooriapäevad 1-3.10.2004 1 Outline Introduction Hierarchical drawing & Sugiyama algorithm Linear Programming (LP) and Integer Linear
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationStable sets, corner polyhedra and the Chvátal closure
Stable sets, corner polyhedra and the Chvátal closure Manoel Campêlo Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Brazil, mcampelo@lia.ufc.br. Gérard Cornuéjols Tepper
More informationCS 343: Artificial Intelligence
CS 343: Artificial Intelligence Constraint Satisfaction Problems Prof. Scott Niekum The University of Texas at Austin [These slides are based on those of Dan Klein and Pieter Abbeel for CS188 Intro to
More information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationDecomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition and Dynamic Cut Generation in Integer Linear Programming M.V. Galati Advanced Analytics - Operations R & D, SAS Institute, Chesterbrook, PA 908 Ted K. Ralphs Department of Industrial and
More informationGRAPH THEORY and APPLICATIONS. Factorization Domination Indepence Clique
GRAPH THEORY and APPLICATIONS Factorization Domination Indepence Clique Factorization Factor A factor of a graph G is a spanning subgraph of G, not necessarily connected. G is the sum of factors G i, if:
More informationTR/03/94 March 1994 ZERO-ONE IP PROBLEMS: POLYHEDRAL DESCRIPTIONS AND CUTTING PLANE PROCEDURES. Fatimah Abdul-Hamid Gautam Mitra Leslie-Ann Yarrow
TR/3/94 March 994 ZERO-ONE IP PROBLEMS: POLYHEDRAL DESCRIPTIONS AND CUTTING PLANE PROCEDURES Fatimah Abdul-Hamid Gautam Mitra Leslie-Ann Yarrow Contents - Abstract i - Introduction.- Classes of valid inequalities
More informationLagrangian Relaxation in CP
Lagrangian Relaxation in CP Willem-Jan van Hoeve CPAIOR 016 Master Class Overview 1. Motivation for using Lagrangian Relaxations in CP. Lagrangian-based domain filtering Example: Traveling Salesman Problem.
More informationCS 188: Artificial Intelligence. What is Search For? Constraint Satisfaction Problems. Constraint Satisfaction Problems
CS 188: Artificial Intelligence Constraint Satisfaction Problems Constraint Satisfaction Problems N variables domain D constraints x 1 x 2 Instructor: Marco Alvarez University of Rhode Island (These slides
More information6. Lecture notes on matroid intersection
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm
More informationLet G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v.
Graph Adjacent Endpoint of an edge Incident Neighbors of a vertex Degree of a vertex Theorem Graph relation Order of a graph Size of a graph Maximum and minimum degree Let G = (V, E) be a graph. If u,
More information1. Lecture notes on bipartite matching
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in
More informationMathematics for Decision Making: An Introduction. Lecture 4
Mathematics for Decision Making: An Introduction Lecture 4 Matthias Köppe UC Davis, Mathematics January 15, 2009 4 1 Modeling the TSP as a standard optimization problem, I A key observation is that every
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationNETWORK SURVIVABILITY AND POLYHEDRAL ANALYSIS
NETWORK SURVIVABILITY AND POLYHEDRAL ANALYSIS A. Ridha Mahjoub LAMSADE, Université Paris-Dauphine, Paris, France Seminar UF Rio de Janeiro, April 9, 204 . Polyhedral techniques Contents.. Polyhedral Approach.2.
More information1 Matching in Non-Bipartite Graphs
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: September 30, 2010 Scribe: David Tobin 1 Matching in Non-Bipartite Graphs There are several differences
More informationLecture 3. Brute Force
Lecture 3 Brute Force 1 Lecture Contents 1. Selection Sort and Bubble Sort 2. Sequential Search and Brute-Force String Matching 3. Closest-Pair and Convex-Hull Problems by Brute Force 4. Exhaustive Search
More informationGraph Coloring via Constraint Programming-based Column Generation
Graph Coloring via Constraint Programming-based Column Generation Stefano Gualandi Federico Malucelli Dipartimento di Elettronica e Informatica, Politecnico di Milano Viale Ponzio 24/A, 20133, Milan, Italy
More informationFinite Math Linear Programming 1 May / 7
Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationAn SDP Approach to Multi-level Crossing Minimization
An SDP Approach to Multi-level Crossing Minimization P. Hungerländer joint work with M. Chimani, M. Jünger, P. Mutzel University of Klagenfurt - Department of Mathematics 15th Combinatorial Optimization
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationTarget Cuts from Relaxed Decision Diagrams
Target Cuts from Relaxed Decision Diagrams Christian Tjandraatmadja 1, Willem-Jan van Hoeve 1 1 Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA {ctjandra,vanhoeve}@andrew.cmu.edu
More information5 MST and Greedy Algorithms
5 MST and Greedy Algorithms One of the traditional and practically motivated problems of discrete optimization asks for a minimal interconnection of a given set of terminals (meaning that every pair will
More informationNotes for Recitation 9
6.042/18.062J Mathematics for Computer Science October 8, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 9 1 Traveling Salesperson Problem Now we re going to talk about a famous optimization
More informationmaximize c, x subject to Ax b,
Lecture 8 Linear programming is about problems of the form maximize c, x subject to Ax b, where A R m n, x R n, c R n, and b R m, and the inequality sign means inequality in each row. The feasible set
More informationSimplicial Global Optimization
Simplicial Global Optimization Julius Žilinskas Vilnius University, Lithuania September, 7 http://web.vu.lt/mii/j.zilinskas Global optimization Find f = min x A f (x) and x A, f (x ) = f, where A R n.
More informationMathematical Programming Formulations, Constraint Programming
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Mathematical Programming Formulations, Constraint Programming 1. Special Purpose Algorithms 2. Constraint Programming Marco Chiarandini DM87 Scheduling,
More informationAnnouncements. Homework 1: Search. Project 1: Search. Midterm date and time has been set:
Announcements Homework 1: Search Has been released! Due Monday, 2/1, at 11:59pm. On edx online, instant grading, submit as often as you like. Project 1: Search Has been released! Due Friday 2/5 at 5pm.
More informationUsing the OPTMODEL Procedure in SAS/OR to Solve Complex Problems. Rob Pratt, Senior R&D Manager, SAS/OR
Using the OPTMODEL Procedure in SAS/OR to Solve Complex Problems Rob Pratt, Senior R&D Manager, SAS/OR Outline 1 Recent Features in PROC OPTMODEL 2 Graph Partitioning with Connectivity Constraints 2 /
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More informationCS 188: Artificial Intelligence Fall 2011
Announcements Project 1: Search is due next week Written 1: Search and CSPs out soon Piazza: check it out if you haven t CS 188: Artificial Intelligence Fall 2011 Lecture 4: Constraint Satisfaction 9/6/2011
More informationCoping with the Limitations of Algorithm Power Exact Solution Strategies Backtracking Backtracking : A Scenario
Coping with the Limitations of Algorithm Power Tackling Difficult Combinatorial Problems There are two principal approaches to tackling difficult combinatorial problems (NP-hard problems): Use a strategy
More information5 MST and Greedy Algorithms
5 MST and Greedy Algorithms One of the traditional and practically motivated problems of discrete optimization asks for a minimal interconnection of a given set of terminals (meaning that every pair will
More informationW[1]-hardness. Dániel Marx. Recent Advances in Parameterized Complexity Tel Aviv, Israel, December 3, 2017
1 W[1]-hardness Dániel Marx Recent Advances in Parameterized Complexity Tel Aviv, Israel, December 3, 2017 2 Lower bounds So far we have seen positive results: basic algorithmic techniques for fixed-parameter
More informationCutting Planes for Some Nonconvex Combinatorial Optimization Problems
Cutting Planes for Some Nonconvex Combinatorial Optimization Problems Ismael Regis de Farias Jr. Department of Industrial Engineering Texas Tech Summary Problem definition Solution strategy Multiple-choice
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationDecision Problems. Observation: Many polynomial algorithms. Questions: Can we solve all problems in polynomial time? Answer: No, absolutely not.
Decision Problems Observation: Many polynomial algorithms. Questions: Can we solve all problems in polynomial time? Answer: No, absolutely not. Definition: The class of problems that can be solved by polynomial-time
More information11.1. Definitions. 11. Domination in Graphs
11. Domination in Graphs Some definitions Minimal dominating sets Bounds for the domination number. The independent domination number Other domination parameters. 11.1. Definitions A vertex v in a graph
More informationComputation of the Constrained Infinite Time Linear Quadratic Optimal Control Problem
Computation of the Constrained Infinite Time Linear Quadratic Optimal Control Problem July 5, Introduction Abstract Problem Statement and Properties In this paper we will consider discrete-time linear
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationLecture 2 - Introduction to Polytopes
Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.
More informationTraveling Salesperson Problem (TSP)
TSP-0 Traveling Salesperson Problem (TSP) Input: Undirected edge weighted complete graph G = (V, E, W ), where W : e R +. Tour: Find a path that starts at vertex 1, visits every vertex exactly once, and
More informationApplied Integer Programming
Applied Integer Programming D.S. Chen; R.G. Batson; Y. Dang Fahimeh 8.2 8.7 April 21, 2015 Context 8.2. Convex sets 8.3. Describing a bounded polyhedron 8.4. Describing unbounded polyhedron 8.5. Faces,
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 29 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/7/2016 Approximation
More informationDynamic programming. Trivial problems are solved first More complex solutions are composed from the simpler solutions already computed
Dynamic programming Solves a complex problem by breaking it down into subproblems Each subproblem is broken down recursively until a trivial problem is reached Computation itself is not recursive: problems
More informationEuler and Hamilton paths. Jorge A. Cobb The University of Texas at Dallas
Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas 1 Paths and the adjacency matrix The powers of the adjacency matrix A r (with normal, not boolean multiplication) contain the number
More informationApproximation Algorithms
Approximation Algorithms Given an NP-hard problem, what should be done? Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one of three desired features. Solve problem to optimality.
More informationLarge-Scale Optimization and Logical Inference
Large-Scale Optimization and Logical Inference John Hooker Carnegie Mellon University October 2014 University College Cork Research Theme Large-scale optimization and logical inference. Optimization on
More informationChapter 10 Part 1: Reduction
//06 Polynomial-Time Reduction Suppose we could solve Y in polynomial-time. What else could we solve in polynomial time? don't confuse with reduces from Chapter 0 Part : Reduction Reduction. Problem X
More informationFinding 2-Factors Closer to TSP in Cubic Graphs
Finding 2-Factors Closer to TSP in Cubic Graphs Sylvia Boyd (EECS, Univ. Ottawa) Satoru Iwata (RIMS, Kyoto Univ.) Kenjiro Takazawa (RIMS, Kyoto Univ.) My History of Bills : Bill Cook My History of Bills
More informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationAnnouncements. CS 188: Artificial Intelligence Fall 2010
Announcements Project 1: Search is due Monday Looking for partners? After class or newsgroup Written 1: Search and CSPs out soon Newsgroup: check it out CS 188: Artificial Intelligence Fall 2010 Lecture
More informationBinary Positive Semidefinite Matrices and Associated Integer Polytopes
Binary Positive Semidefinite Matrices and Associated Integer Polytopes Adam N. Letchford 1 and Michael M. Sørensen 2 1 Department of Management Science, Lancaster University, Lancaster LA1 4YW, United
More informationThe Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph
Applied Mathematics E-Notes, 15(2015), 261-275 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ The Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph KrishnaPillai
More informationLecture 7. s.t. e = (u,v) E x u + x v 1 (2) v V x v 0 (3)
COMPSCI 632: Approximation Algorithms September 18, 2017 Lecturer: Debmalya Panigrahi Lecture 7 Scribe: Xiang Wang 1 Overview In this lecture, we will use Primal-Dual method to design approximation algorithms
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationCS671 Parallel Programming in the Many-Core Era
1 CS671 Parallel Programming in the Many-Core Era Polyhedral Framework for Compilation: Polyhedral Model Representation, Data Dependence Analysis, Scheduling and Data Locality Optimizations December 3,
More informationLecture 14: Linear Programming II
A Theorist s Toolkit (CMU 18-859T, Fall 013) Lecture 14: Linear Programming II October 3, 013 Lecturer: Ryan O Donnell Scribe: Stylianos Despotakis 1 Introduction At a big conference in Wisconsin in 1948
More informationDecomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition and Dynamic Cut Generation in Integer Linear Programming T.K. Ralphs M.V. Galati Revised August, 00 Abstract Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition
More information