Small (Explicit) Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
|
|
- Monica Wiggins
- 5 years ago
- Views:
Transcription
1 Small (Explicit) Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits Abbas Bazzi Samuel Fiorini Sangxia Huang Ola Svensson & Samuel Fiorini Tony Huynh Stefan Weltge
2 Extended formulations vs circuit complexity [Hrubeš 12, GJW 16] connection between circuit complexity and extended formulations What is the smallest LP for solving problem A? Q P
3 Extended formulations vs circuit complexity [Hrubeš 12, GJW 16] connection between circuit complexity and extended formulations What is the smallest LP for solving problem A? What is the smallest depth circuit for solving problem B? Q P
4 Extended formulations vs circuit complexity [Hrubeš 12, GJW 16] connection between circuit complexity and extended formulations What is the smallest LP for solving problem A? What is the smallest depth circuit for solving problem B? Q P 2 Ω(n) size LP lower bound for matchings = matching requires monotone circuits of Ω(n) depth
5 Extended formulations vs circuit complexity [Hrubeš 12, GJW 16] connection between circuit complexity and extended formulations What is the smallest LP for solving problem A? What is the smallest depth circuit for solving problem B? Q P We use that certain functions have small depth monotone circuits to give small explicit LPs for covering problems
6 Our problem 1 Simplest binary integer program with single covering constraint: 100x x x x 1, x 2, x 3 {0, 1} 2 Write down an LP relaxation: 100x x x x 1, x 2, x 3 1 # inequalities = 7 3 Adversary finds worst objective function (= evaluates integrality gap) If min x 2 + x 3, then IP optimum = 1 LP optimum = 1/50 = Integrality gap = 50
7 Our problem 1 Simplest binary integer program with single covering constraint: 100x x x x 1, x 2, x 3 {0, 1} 2 Write down an LP relaxation: x 1 = 1 x 2 + x x 2, x 3 1 # inequalities = 5 3 Adversary finds worst objective function (= evaluates integrality gap) For any objective fn IP optimum = LP optimum = Integrality gap = 1
8 Our problem formally 1 Simplest 0/1-set defined by single covering constraint n a ix i β where a Z n + and β Z + i=1 x {0, 1} n convex hull of integer solutions = min-knapsack polytope
9 Our problem formally 1 Simplest 0/1-set defined by single covering constraint n a ix i β where a Z n + and β Z + i=1 x {0, 1} n convex hull of integer solutions = min-knapsack polytope 2 Write down an LP relaxation = extended formulation Ax + By = c Dx + Ey f equality constraints inequality constraints
10 Our problem formally 1 Simplest 0/1-set defined by single covering constraint n a ix i β where a Z n + and β Z + i=1 x {0, 1} n convex hull of integer solutions = min-knapsack polytope 2 Write down an LP relaxation = extended formulation Ax + By = c Dx + Ey f equality constraints inequality constraints 3 Evaluate the relaxation vs all possible objective functions in terms of size = # inequalities integrality gap = sup IP optimum LP optimum
11 State of the Art Knapsack-cover ineqs [Balas 75, Hammer et al. 75, Wolsey 75, Carr et al. 06] There are exponentially many (but approximately separable) inequalities that bring the integrality gap down to 2 Many applications: Network design Facility location Scheduling Question Is there a poly-size relaxation with any constant integrality gap? Previously: [Bienstock and McClosky 12] can be done when the objective is sorted
12 State of the Art Knapsack-cover ineqs [Balas 75, Hammer et al. 75, Wolsey 75, Carr et al. 06] There are exponentially many (but approximately separable) inequalities that bring the integrality gap down to 2 Many applications: Network design Facility location Scheduling Question Is there a poly-size relaxation with any constant integrality gap? Previously: [Bienstock and McClosky 12] can be done when the objective is sorted... our first feeling: maybe there is no such relaxation?
13 Our results (1/2) Theorem (Existential Bazzi, F, Huang, Svensson 17) The min-knapsack polytope can be (2 + ε)-approximated by an LP of size (n/ε) O(1) 2 O(d) where d is the minimum depth of a monotone circuit that computes (truncactions of) the corresponding weighted threshold function
14 Our results (1/2) Theorem (Existential Bazzi, F, Huang, Svensson 17) The min-knapsack polytope can be (2 + ε)-approximated by an LP of size (n/ε) O(1) 2 O(d) where d is the minimum depth of a monotone circuit that computes (truncactions of) the corresponding weighted threshold function [Beimel & Weinreb 08] Weighted threshold functions { 1 if n i=1 aixi β f(x 1,..., x n) = 0 otherwise have monotone circuits of depth O(log 2 n)
15 Our results (1/2) Theorem (Existential Bazzi, F, Huang, Svensson 17) The min-knapsack polytope can be (2 + ε)-approximated by an LP of size (n/ε) O(1) 2 O(d) where d is the minimum depth of a monotone circuit that computes (truncactions of) the corresponding weighted threshold function [Beimel & Weinreb 08] Weighted threshold functions { 1 if n i=1 aixi β f(x 1,..., x n) = 0 otherwise have monotone circuits of depth O(log 2 n) Corollary (Existential Bazzi, F, Huang, Svensson 17) The min-knapsack polytope can be (2 + ε)-approximated by an LP of size (1/ε) O(1) O(log n) n
16 A galaxy of hierarchies
17 Strengthening relaxations using formulas S {0, 1} n 0/1-set φ Boolean formula defining S Q [0, 1] n convex relaxation of S New relaxation φ(q) with S φ(q) Q
18 Strengthening relaxations using formulas S {0, 1} n 0/1-set φ Boolean formula defining S Q [0, 1] n convex relaxation of S New relaxation φ(q) with S φ(q) Q Starting from φ, recursively apply rules: Replace x i by Q {x : x i = 1} Replace x i by Q {x : x i = 0} Replace φ 1 φ 2 by φ 1(Q) φ 2(Q) Replace φ 1 φ 2 by conv(φ 1(Q) φ 2(Q))
19 Strengthening relaxations using formulas S {0, 1} n 0/1-set φ Boolean formula defining S Q [0, 1] n convex relaxation of S New relaxation φ(q) with S φ(q) Q Starting from φ, recursively apply rules: Replace x i by Q {x : x i = 1} Replace x i by Q {x : x i = 0} Replace φ 1 φ 2 by φ 1(Q) φ 2(Q) Replace φ 1 φ 2 by conv(φ 1(Q) φ 2(Q)) 0/1-set: S = {x {0, 1} 3 : x 1 + x 2 + x 3 2} Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := [0, 1] 3
20 Strengthening relaxations using formulas S {0, 1} n 0/1-set φ Boolean formula defining S Q [0, 1] n convex relaxation of S New relaxation φ(q) with S φ(q) Q Starting from φ, recursively apply rules: Replace x i by Q {x : x i = 1} Replace x i by Q {x : x i = 0} Replace φ 1 φ 2 by φ 1(Q) φ 2(Q) Replace φ 1 φ 2 by conv(φ 1(Q) φ 2(Q)) 0/1-set: S = {x {0, 1} 3 : x 1 + x 2 + x 3 2} Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) monotone Relaxation: Q := [0, 1] 3
21 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := [0, 1] 3 x 1 x 2 x 2 x 3 x 3 x 1
22 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := [0, 1] 3 x 1 x 2 x 2 x 3 x 3 x 1
23 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := [0, 1] 3 x 1 x 2 x 2 x 3 x 3 x 1
24 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := [0, 1] 3 x 1 x 2 x 2 x 3 x 3 x 1
25 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := [0, 1] 3 x 1 x 2 x 2 x 3 x 3 x 1
26 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := [0, 1] 3 x 1 x 2 x 2 x 3 x 3 x 1
27 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := φ([0, 1] 3 ) x 1 x 2 x 2 x 3 x 3 x 1
28 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := φ([0, 1] 3 ) x 1 x 2 x 2 x 3 x 3 x 1
29 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := φ([0, 1] 3 ) x 1 x 2 x 2 x 3 x 3 x 1
30 Formula: φ = (x 1 x 2) (x 2 x 3) (x 3 x 1) Relaxation: Q := φ([0, 1] 3 ) x 1 x 2 x 2 x 3 x 3 x 1
31 Our results (2/2) Proposition (F, Huynh & Weltge 17) If Q [0, 1] n is a polytope then φ(q) also, and moreover xc(φ(q)) φ xc(q)
32 Our results (2/2) Proposition (F, Huynh & Weltge 17) If Q [0, 1] n is a polytope then φ(q) also, and moreover xc(φ(q)) φ xc(q) Theorem (F, Huynh & Weltge 17) Assuming φ monotone, Q satisfies all valid pitch k inequalities = φ(q) satisfies all valid pitch k + 1 inequalities
33 Our results (2/2) Proposition (F, Huynh & Weltge 17) If Q [0, 1] n is a polytope then φ(q) also, and moreover xc(φ(q)) φ xc(q) Theorem (F, Huynh & Weltge 17) Assuming φ monotone, Q satisfies all valid pitch k inequalities = φ(q) satisfies all valid pitch k + 1 inequalities The pitch measures how complex ineqs are (Bienstock & Zuckerberg 04):
34 Our results (2/2) Proposition (F, Huynh & Weltge 17) If Q [0, 1] n is a polytope then φ(q) also, and moreover xc(φ(q)) φ xc(q) Theorem (F, Huynh & Weltge 17) Assuming φ monotone, Q satisfies all valid pitch k inequalities = φ(q) satisfies all valid pitch k + 1 inequalities The pitch measures how complex ineqs are (Bienstock & Zuckerberg 04): x 1 1, x 1 + x 3 + x 7 1 have pitch 1
35 Our results (2/2) Proposition (F, Huynh & Weltge 17) If Q [0, 1] n is a polytope then φ(q) also, and moreover xc(φ(q)) φ xc(q) Theorem (F, Huynh & Weltge 17) Assuming φ monotone, Q satisfies all valid pitch k inequalities = φ(q) satisfies all valid pitch k + 1 inequalities The pitch measures how complex ineqs are (Bienstock & Zuckerberg 04): x 1 1, x 1 + x 3 + x 7 1 have pitch 1 x 1 + x 5 2, 2x 3 + x 4 + x 5 2 have pitch 2
36 Our results (2/2) Proposition (F, Huynh & Weltge 17) If Q [0, 1] n is a polytope then φ(q) also, and moreover xc(φ(q)) φ xc(q) Theorem (F, Huynh & Weltge 17) Assuming φ monotone, Q satisfies all valid pitch k inequalities = φ(q) satisfies all valid pitch k + 1 inequalities The pitch measures how complex ineqs are (Bienstock & Zuckerberg 04): x 1 1, x 1 + x 3 + x 7 1 have pitch 1 x 1 + x 5 2, 2x 3 + x 4 + x 5 2 have pitch 2 2x 3 + x 4 + 2x 7 3
37 Our results (2/2) Proposition (F, Huynh & Weltge 17) If Q [0, 1] n is a polytope then φ(q) also, and moreover xc(φ(q)) φ xc(q) Theorem (F, Huynh & Weltge 17) Assuming φ monotone, Q satisfies all valid pitch k inequalities = φ(q) satisfies all valid pitch k + 1 inequalities The pitch measures how complex ineqs are (Bienstock & Zuckerberg 04): x 1 1, x 1 + x 3 + x 7 1 have pitch 1 x 1 + x 5 2, 2x 3 + x 4 + x 5 2 have pitch 2 2x 3 + x 4 + 2x 7 3 has pitch 2
38 BZ s approximation of the CG-closures Theorem (Bienstock & Zuckerberg 06) If Q = {x [0, 1] n : Ax b} for A, b nonnegative, then Q {x x satisfies all valid pitch k ineqs} is (1 + ε)-approx of the l-th CG-closure of Q whenever k = Ω(l/ε)
39 Comparison to BZ 04 Main theorem from Bienstock & Zuckerberg 04, where g(k) = Ω(k 2 ):
40 Comparison to BZ 04 Main theorem from Bienstock & Zuckerberg 04, where g(k) = Ω(k 2 ): Was simplified (but not improved) earlier by Mastrolili 17
41 Comparison to BZ 04 Main theorem from Bienstock & Zuckerberg 04, where g(k) = Ω(k 2 ): Was simplified (but not improved) earlier by Mastrolili 17 If use Q φ k ([0, 1] n ), get extended formulation of size
42 Comparison to BZ 04 Main theorem from Bienstock & Zuckerberg 04, where g(k) = Ω(k 2 ): Was simplified (but not improved) earlier by Mastrolili 17 If use Q φ k ([0, 1] n ), get extended formulation of size xc(q) + 2n (mn) k for obvious CNF formula deciding S
43 Comparison to BZ 04 Main theorem from Bienstock & Zuckerberg 04, where g(k) = Ω(k 2 ): Was simplified (but not improved) earlier by Mastrolili 17 If use Q φ k ([0, 1] n ), get extended formulation of size xc(q) + 2n (mn) k for obvious CNF formula deciding S xc(q) + 2n φ k where φ is any formula deciding S
44 Theorem (F, Huynh & Weltge 17) Assuming φ monotone, Q satisfies all valid pitch k inequalities = φ(q) satisfies all valid pitch k + 1 inequalities Proof (inspired by Karchmer & Widgerson 90) Assume i I c ix + i δ pitch-(k + 1) ineq not valid for φ(q) Letting a {0, 1} n with a i = 0 i I +, have: φ(a) = 0 violator x φ(q) x φ(q)
45 If φ = φ 1 φ 2 then φ 1(a) = 0 or φ 2(a) = 0 violator x 1 φ 1(Q) and violator x 2 φ 2(Q) φ 1(Q) φ 2(Q)
46 If φ = φ 1 φ 2 then φ 1(a) = 0 or φ 2(a) = 0 violator x 1 φ 1(Q) and violator x 2 φ 2(Q) φ 1(Q) φ 2(Q) If φ = φ 1 φ 2 then φ 1(a) = 0 and φ 2(a) = 0 violator x 1 φ 1(Q) or violator x 2 φ 2(Q) φ 1(Q) φ 2(Q)
47 x 1 x 2 x 2 x 3 x 3 x 1
48 x 1 x 2 x 2 x 3 x 3 x 1
49 x 1 x 2 x 2 x 3 x 3 x 1
50 x 1 x 2 x 2 x 3 x 3 x 1
51 x 1 x 2 x 2 x 3 x 3 x 1 Final leaf x j has: a j = 0 j I + violator x Q {x : x j = 1}
52 x 1 x 2 x 2 x 3 x 3 x 1 Final leaf x j has: a j = 0 j I + violator x Q {x : x j = 1} contradicts hypothesis that Q satisfies pitch k ineq c ix i δ c j i j
53
54 Knapsack-cover inequalities Given sizes s 1,..., s n Z + and demand D Z +: f(x) = 1 n s ix i D i=1 s 1 s 2 s 3 s 4 s 5 D
55 Knapsack-cover inequalities Given sizes s 1,..., s n Z + and demand D Z +: f(x) = 1 n s ix i D i=1 s 1 s 2 s 3 s 4 s 5 D
56 Knapsack-cover inequalities Given sizes s 1,..., s n Z + and demand D Z +: f(x) = 1 n s ix i D i=1 s 1 s 2 s 3 s 4 s 5 D
57 Knapsack-cover inequalities Given sizes s 1,..., s n Z + and demand D Z +: f(x) = 1 n s ix i D i=1 s 1 s 2 s 3 s 4 s 5 D
58 Knapsack-cover inequalities Given sizes s 1,..., s n Z + and demand D Z +: f(x) = 1 n s ix i D i=1 s 1 s 2 s 3 s 4 s 5 D
59 Knapsack-cover inequalities Given sizes s 1,..., s n Z + and demand D Z +: f(x) = 1 n s ix i D i=1 s 1 s 2 s 3 s 4 s 5 D Knapsack cover inequality: for a f 1 (0) min({s i, D(a)}) x i D(a) i:a i =0 where D(a) := D n i=1 siai = residual demand
60 Knapsack-cover inequalities Given sizes s 1,..., s n Z + and demand D Z +: f(x) = 1 n s ix i D i=1 s 1 s 2 s 3 s 4 s 5 D Knapsack cover inequality: for a f 1 (0) min({s i, D(a)}) x i D(a) i:a i =0 where D(a) := D n i=1 siai = residual demand Intuition: KC ineq is pitch-1 w.r.t. large items items i such that s i D(a)
61 The relaxation 1 Sort item sizes: s 1 s 2 s n 2 Parametrize the KC inequalities by: α := index of last large item β := i α siai 3 Construct monotone formula φ α,β for threshold function f α,β (x) = 1 i α s ix i β Define relaxation by the following formula: ( ( ) ) φ α,β (x) s ix i D β α,β i>α
62 Final comments We can extend to flow cover inequalities (used e.g. for single demand facility location problem)
63 Final comments We can extend to flow cover inequalities (used e.g. for single demand facility location problem) Open: does min-knapsack admit a n O(1) -size O(1)-apx EF?
64 Final comments We can extend to flow cover inequalities (used e.g. for single demand facility location problem) Open: does min-knapsack admit a n O(1) -size O(1)-apx EF? Open: do weighted threshold fns admit n O(1) -size monotone formulas?
65 Final comments We can extend to flow cover inequalities (used e.g. for single demand facility location problem) Open: does min-knapsack admit a n O(1) -size O(1)-apx EF? Open: do weighted threshold fns admit n O(1) -size monotone formulas? Open: does min-knapsack admit a n O(log n) -size (1 + ε)-apx EF?
66 Final comments We can extend to flow cover inequalities (used e.g. for single demand facility location problem) Open: does min-knapsack admit a n O(1) -size O(1)-apx EF? Open: do weighted threshold fns admit n O(1) -size monotone formulas? Open: does min-knapsack admit a n O(log n) -size (1 + ε)-apx EF? Find more algorithmic applications of Chvátal-Gomory cuts!!
67 Final comments We can extend to flow cover inequalities (used e.g. for single demand facility location problem) Open: does min-knapsack admit a n O(1) -size O(1)-apx EF? Open: do weighted threshold fns admit n O(1) -size monotone formulas? Open: does min-knapsack admit a n O(log n) -size (1 + ε)-apx EF? Find more algorithmic applications of Chvátal-Gomory cuts!!
68 Final comments We can extend to flow cover inequalities (used e.g. for single demand facility location problem) Open: does min-knapsack admit a n O(1) -size O(1)-apx EF? Open: do weighted threshold fns admit n O(1) -size monotone formulas? Open: does min-knapsack admit a n O(log n) -size (1 + ε)-apx EF? Find more algorithmic applications of Chvátal-Gomory cuts!! THANK YOU!
STRENGTHENING CONVEX RELAXATIONS OF 0/1-SETS USING BOOLEAN FORMULAS
STRENGTHENING CONVEX RELAXATIONS OF 0/1-SETS USING BOOLEAN FORMULAS SAMUEL FIORINI, TONY HUYNH, AND STEFAN WELTGE Abstract. In convex integer programming, various procedures have been developed to strengthen
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.05 Recitation 8 TAs: Giacomo Nannicini, Ebrahim Nasrabadi At the end of this recitation, students should be able to: 1. Derive Gomory cut from fractional
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 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 informationInteger Programming: Cutting Planes
OptIntro 1 / 39 Integer Programming: Cutting Planes Eduardo Camponogara Department of Automation and Systems Engineering Federal University of Santa Catarina October 2016 OptIntro 2 / 39 Summary Introduction
More informationBreaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds Kenya Ueno The Young Researcher Development Center and Graduate School of Informatics, Kyoto University kenya@kuis.kyoto-u.ac.jp Abstract.
More informationOn the knapsack closure of 0-1 Integer Linear Programs. Matteo Fischetti University of Padova, Italy
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti University of Padova, Italy matteo.fischetti@unipd.it Andrea Lodi University of Bologna, Italy alodi@deis.unibo.it Aussois, January
More informationAM 121: Intro to Optimization! Models and Methods! Fall 2018!
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 15: Cutting plane methods Yiling Chen SEAS Lesson Plan Cut generation and the separation problem Cutting plane methods Chvatal-Gomory
More informationChange in the State of the Art of (Mixed) Integer Programming
Change in the State of the Art of (Mixed) Integer Programming 1977 Vancouver Advanced Research Institute 24 papers 16 reports 1 paper computational, 4 small instances Report on computational aspects: only
More informationOn the knapsack closure of 0-1 Integer Linear Programs
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti 1 Dipartimento di Ingegneria dell Informazione University of Padova Padova, Italy Andrea Lodi 2 Dipartimento di Elettronica, Informatica
More informationInteger Programming Methods LNMB
Integer Programming Methods LNMB 2017 2018 Dion Gijswijt homepage.tudelft.nl/64a8q/intpm/ Dion Gijswijt Intro IntPM 2017-2018 1 / 24 Organisation Webpage: homepage.tudelft.nl/64a8q/intpm/ Book: Integer
More informationTopics in Theoretical Computer Science April 08, Lecture 8
Topics in Theoretical Computer Science April 08, 204 Lecture 8 Lecturer: Ola Svensson Scribes: David Leydier and Samuel Grütter Introduction In this lecture we will introduce Linear Programming. It was
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 informationSuccinct linear programs for easy problems
Succinct linear programs for easy problems David Bremner U. New Brunswick / visiting TU Berlin 24-11-2014 Joint Work with D. Avis, H.R. Tiwary, and O. Watanabe Outline 1 Matchings and Matching Polytopes
More informationCombinatorial Optimization
Combinatorial Optimization Lecture notes, WS 2010/11, TU Munich Prof. Dr. Raymond Hemmecke Version of February 9, 2011 Contents 1 The knapsack problem 1 1.1 Complete enumeration..................................
More informationRepresentations of Monotone Boolean Functions by Linear Programs
Electronic Colloquium on Computational Complexity, Report No. 106 (2017) Representations of Monotone Boolean Functions by Linear Programs Mateus de Oliveira Oliveira and Pavel Pudlák April 10, 2017 Abstract
More informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationCutting Planes and Elementary Closures for Non-linear Integer Programming
Cutting Planes and Elementary Closures for Non-linear Integer Programming Juan Pablo Vielma University of Pittsburgh joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute
More informationDUALITY AND INTEGER PROGRAMMING. Jean B. LASSERRE
LABORATOIRE d ANALYSE et d ARCHITECTURE des SYSTEMES DUALITY AND INTEGER PROGRAMMING Jean B. LASSERRE 1 Current solvers (CPLEX, XPRESS-MP) are rather efficient and can solve many large size problems with
More informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
More informationMINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS. Albert Atserias Universitat Politècnica de Catalunya Barcelona
MINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS Albert Atserias Universitat Politècnica de Catalunya Barcelona Part I CONVEX POLYTOPES Convex polytopes as linear inequalities Polytope: P = {x R n : Ax b}
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
More informationTHE EXISTENCE AND USEFULNESS OF EQUALITY CUTS IN THE MULTI-DEMAND MULTIDIMENSIONAL KNAPSACK PROBLEM LEVI DELISSA. B.S., Kansas State University, 2014
THE EXISTENCE AND USEFULNESS OF EQUALITY CUTS IN THE MULTI-DEMAND MULTIDIMENSIONAL KNAPSACK PROBLEM by LEVI DELISSA B.S., Kansas State University, 2014 A THESIS submitted in partial fulfillment of the
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 informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 P and NP P: The family of problems that can be solved quickly in polynomial time.
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
More informationPolyhedral Approach to Integer Linear Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
Polyhedral Approach to Integer Linear Programming Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh 1 / 30 Brief history First Algorithms Polynomial Algorithms Solving
More informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
More informationDiscrete Optimization 2010 Lecture 7 Introduction to Integer Programming
Discrete Optimization 2010 Lecture 7 Introduction to Integer Programming Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Intro: The Matching
More informationDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon
More informationconstraints Ax+Gy» b (thus any valid inequalityforp is of the form u(ax+gy)» ub for u 2 R m + ). In [13], Gomory introduced a family of valid inequali
On the Rank of Mixed 0,1 Polyhedra Λ Gérard Cornuéjols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA (corresponding author: gc0v@andrew.cmu.edu) February
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More informationMIP reformulations of some chance-constrained mathematical programs
MIP reformulations of some chance-constrained mathematical programs Ricardo Fukasawa Department of Combinatorics & Optimization University of Waterloo December 4th, 2012 FIELDS Industrial Optimization
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 informationOptimization Exercise Set n. 4 :
Optimization Exercise Set n. 4 : Prepared by S. Coniglio and E. Amaldi translated by O. Jabali 2018/2019 1 4.1 Airport location In air transportation, usually there is not a direct connection between every
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 informationA Lower Bound on the Split Rank of Intersection Cuts
A Lower Bound on the Split Rank of Intersection Cuts Santanu S. Dey H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. 200 Outline Introduction: split rank,
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 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 informationInteger Programming Duality
Integer Programming Duality M. Guzelsoy T. K. Ralphs July, 2010 1 Introduction This article describes what is known about duality for integer programs. It is perhaps surprising that many of the results
More informationLimitations of Algorithm Power
Limitations of Algorithm Power Objectives We now move into the third and final major theme for this course. 1. Tools for analyzing algorithms. 2. Design strategies for designing algorithms. 3. Identifying
More informationMarch 2002, December Introduction. We investigate the facial structure of the convex hull of the mixed integer knapsack set
ON THE FACETS OF THE MIXED INTEGER KNAPSACK POLYHEDRON ALPER ATAMTÜRK Abstract. We study the mixed integer knapsack polyhedron, that is, the convex hull of the mixed integer set defined by an arbitrary
More informationInteger Programming ISE 418. Lecture 13b. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13b Dr. Ted Ralphs ISE 418 Lecture 13b 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationOn the Rank of Cutting-Plane Proof Systems
On the Rank of Cutting-Plane Proof Systems Sebastian Pokutta 1 and Andreas S. Schulz 2 1 H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA. Email:
More informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
More informationThe master equality polyhedron with multiple rows
The master equality polyhedron with multiple rows Sanjeeb Dash Ricardo Fukasawa IBM Research February 17, 2009 Oktay Günlük Abstract The master equality polyhedron (MEP) is a canonical set that generalizes
More informationLifting for conic mixed-integer programming
Math. Program., Ser. A DOI 1.17/s117-9-282-9 FULL LENGTH PAPER Lifting for conic mixed-integer programming Alper Atamtürk Vishnu Narayanan Received: 13 March 28 / Accepted: 28 January 29 The Author(s)
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 informationarxiv: v1 [math.oc] 3 Jan 2019
The Product Knapsack Problem: Approximation and Complexity arxiv:1901.00695v1 [math.oc] 3 Jan 2019 Ulrich Pferschy a, Joachim Schauer a, Clemens Thielen b a Department of Statistics and Operations Research,
More information{0, 1 2. }-Chvátal-Gomory Cuts. Algorithms to Separate. Konrad-Zuse-Zentrum für Informationstechnik Berlin
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany ARIE M.C.A. KOSTER ADRIAN ZYMOLKA MANUEL KUTSCHKA Algorithms to Separate {0, 1 2 }-Chvátal-Gomory Cuts ZIB-Report
More informationOn the matrix-cut rank of polyhedra
On the matrix-cut rank of polyhedra William Cook and Sanjeeb Dash Computational and Applied Mathematics Rice University August 5, 00 Abstract Lovász and Schrijver (99) described a semi-definite operator
More informationThe master equality polyhedron with multiple rows
The master equality polyhedron with multiple rows Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Ricardo Fukasawa University of Waterloo rfukasaw@math.uwaterloo.ca September 16, 2010 Oktay Günlük IBM Research
More information1 Column Generation and the Cutting Stock Problem
1 Column Generation and the Cutting Stock Problem In the linear programming approach to the traveling salesman problem we used the cutting plane approach. The cutting plane approach is appropriate when
More information3.7 Strong valid inequalities for structured ILP problems
3.7 Strong valid inequalities for structured ILP problems By studying the problem structure, we can derive strong valid inequalities yielding better approximations of conv(x ) and hence tighter bounds.
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More informationCutting planes from extended LP formulations
Cutting planes from extended LP formulations Merve Bodur University of Wisconsin-Madison mbodur@wisc.edu Sanjeeb Dash IBM Research sanjeebd@us.ibm.com March 7, 2016 Oktay Günlük IBM Research gunluk@us.ibm.com
More informationIntroduction to Integer Programming
Lecture 3/3/2006 p. /27 Introduction to Integer Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Lecture 3/3/2006 p. 2/27 Contents IP formulations and examples Total unimodularity
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationLower bounds on the size of semidefinite relaxations. David Steurer Cornell
Lower bounds on the size of semidefinite relaxations David Steurer Cornell James R. Lee Washington Prasad Raghavendra Berkeley Institute for Advanced Study, November 2015 overview of results unconditional
More informationDescription of 2-integer continuous knapsack polyhedra
Discrete Optimization 3 (006) 95 0 www.elsevier.com/locate/disopt Description of -integer continuous knapsack polyhedra A. Agra a,, M. Constantino b a Department of Mathematics and CEOC, University of
More informationCutting Planes for First Level RLT Relaxations of Mixed 0-1 Programs
Cutting Planes for First Level RLT Relaxations of Mixed 0-1 Programs 1 Cambridge, July 2013 1 Joint work with Franklin Djeumou Fomeni and Adam N. Letchford Outline 1. Introduction 2. Literature Review
More informationCSE541 Class 22. Jeremy Buhler. November 22, Today: how to generalize some well-known approximation results
CSE541 Class 22 Jeremy Buhler November 22, 2016 Today: how to generalize some well-known approximation results 1 Intuition: Behavior of Functions Consider a real-valued function gz) on integers or reals).
More informationThe Separation Problem for Binary Decision Diagrams
The Separation Problem for Binary Decision Diagrams J. N. Hooker Joint work with André Ciré Carnegie Mellon University ISAIM 2014 Separation Problem in Optimization Given a relaxation of an optimization
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 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 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 informationOn the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
MATHEMATICS OF OPERATIONS RESEARCH Vol. xx, No. x, Xxxxxxx 00x, pp. xxx xxx ISSN 0364-765X EISSN 156-5471 0x xx0x 0xxx informs DOI 10.187/moor.xxxx.xxxx c 00x INFORMS On the Power of Robust Solutions in
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 informationTheoretical challenges towards cutting-plane selection
Theoretical challenges towards cutting-plane selection Santanu S. Dey 1 and Marco Molinaro 2 1 School of Industrial and Systems Engineering, Georgia Institute of Technology 2 Computer Science Department,
More informationKnapsack. Bag/knapsack of integer capacity B n items item i has size s i and profit/weight w i
Knapsack Bag/knapsack of integer capacity B n items item i has size s i and profit/weight w i Goal: find a subset of items of maximum profit such that the item subset fits in the bag Knapsack X: item set
More informationTwo-Term Disjunctions on the Second-Order Cone
Noname manuscript No. (will be inserted by the editor) Two-Term Disjunctions on the Second-Order Cone Fatma Kılınç-Karzan Sercan Yıldız the date of receipt and acceptance should be inserted later Abstract
More informationMulti-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size
Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size Ran Raz Weizmann Institute ranraz@wisdom.weizmann.ac.il Abstract An arithmetic formula is multi-linear if the polynomial
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 information1 Maximal Lattice-free Convex Sets
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 3 Date: 03/23/2010 In this lecture, we explore the connections between lattices of R n and convex sets in R n. The structures will prove
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method Notes taken by Stefan Mathe April 28, 2007 Summary: Throughout the course, we have seen the importance
More informationCHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY. E. Amaldi Foundations of Operations Research Politecnico di Milano 1
CHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Goal: Evaluate the computational requirements (this course s focus: time) to solve
More informationScheduling on Unrelated Parallel Machines. Approximation Algorithms, V. V. Vazirani Book Chapter 17
Scheduling on Unrelated Parallel Machines Approximation Algorithms, V. V. Vazirani Book Chapter 17 Nicolas Karakatsanis, 2008 Description of the problem Problem 17.1 (Scheduling on unrelated parallel machines)
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 informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationSome Relationships between Disjunctive Cuts and Cuts based on S-free Convex Sets
Some Relationships between Disjunctive Cuts and Cuts based on S-free Convex Sets Sanjeeb Dash a Santanu S. Dey b Oktay Günlük a a Business Analytics and Mathematical Sciences Department, IBM T. J. Watson
More informationLec. 2: Approximation Algorithms for NP-hard Problems (Part II)
Limits of Approximation Algorithms 28 Jan, 2010 (TIFR) Lec. 2: Approximation Algorithms for NP-hard Problems (Part II) Lecturer: Prahladh Harsha Scribe: S. Ajesh Babu We will continue the survey of approximation
More information3.8 Strong valid inequalities
3.8 Strong valid inequalities By studying the problem structure, we can derive strong valid inequalities which lead to better approximations of the ideal formulation conv(x ) and hence to tighter bounds.
More informationCS Communication Complexity: Applications and New Directions
CS 2429 - Communication Complexity: Applications and New Directions Lecturer: Toniann Pitassi 1 Introduction In this course we will define the basic two-party model of communication, as introduced in the
More informationAn Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem Claudia Archetti (1) Martin W.P. Savelsbergh (2) M. Grazia Speranza (1) (1) University of Brescia, Department of Quantitative
More information8 Knapsack Problem 8.1 (Knapsack)
8 Knapsack In Chapter 1 we mentioned that some NP-hard optimization problems allow approximability to any required degree. In this chapter, we will formalize this notion and will show that the knapsack
More informationA note on monotone real circuits
A note on monotone real circuits Pavel Hrubeš and Pavel Pudlák March 14, 2017 Abstract We show that if a Boolean function f : {0, 1} n {0, 1} can be computed by a monotone real circuit of size s using
More informationLecture 6,7 (Sept 27 and 29, 2011 ): Bin Packing, MAX-SAT
,7 CMPUT 675: Approximation Algorithms Fall 2011 Lecture 6,7 (Sept 27 and 29, 2011 ): Bin Pacing, MAX-SAT Lecturer: Mohammad R. Salavatipour Scribe: Weitian Tong 6.1 Bin Pacing Problem Recall the bin pacing
More informationOn Counting Lattice Points and Chvátal-Gomory Cutting Planes
On Counting Lattice Points and Chvátal-Gomory Cutting Planes Andrea Lodi 1, Gilles Pesant 2, and Louis-Martin Rousseau 2 1 DEIS, Università di Bologna - andrea.lodi@unibo.it 2 CIRRELT, École Polytechnique
More informationApproximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming Daniel Bienstock, Jay Sethuraman, Chun Ye Department of Industrial Engineering and Operations Research Columbia
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationIn the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight.
In the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight. In the multi-dimensional knapsack problem, additional
More informationLecture 11 October 7, 2013
CS 4: Advanced Algorithms Fall 03 Prof. Jelani Nelson Lecture October 7, 03 Scribe: David Ding Overview In the last lecture we talked about set cover: Sets S,..., S m {,..., n}. S has cost c S. Goal: Cover
More informationCuts for mixed 0-1 conic programs
Cuts for mixed 0-1 conic programs G. Iyengar 1 M. T. Cezik 2 1 IEOR Department Columbia University, New York. 2 GERAD Université de Montréal, Montréal TU-Chemnitz Workshop on Integer Programming and Continuous
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 informationCritical Reading of Optimization Methods for Logical Inference [1]
Critical Reading of Optimization Methods for Logical Inference [1] Undergraduate Research Internship Department of Management Sciences Fall 2007 Supervisor: Dr. Miguel Anjos UNIVERSITY OF WATERLOO Rajesh
More informationCSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010
CSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010 We now embark on a study of computational classes that are more general than NP. As these classes
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More informationCORC REPORT Approximate fixed-rank closures of covering problems
CORC REPORT 2003-01 Approximate fixed-rank closures of covering problems Daniel Bienstock and Mark Zuckerberg (Columbia University) January, 2003 version 2004-August-25 Abstract Consider a 0/1 integer
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 information