ILP Formulations for the Lazy Bureaucrat Problem
|
|
- Preston Holmes
- 6 years ago
- Views:
Transcription
1 the the PSL, Université Paris-Dauphine, Paris Cedex 16, France, CNRS, LAMSADE UMR 7243 Department of Statistics and Operations Research, University of Vienna, Vienna, Austria EURO 2015, July, Glasgow
2 Outline the
3 the The lazy bureaucrat problem (LBP) is a scheduling problem (common arrivals and deadlines) in which a set of jobs has to be scheduled in the most inefficient way! Definition The lazy bureaucrat needs to choose a subset of jobs to execute in a single day, in a such a way that: no other job fits in his/her working hours the total profit of selected jobs (e.g., their duration) is minimized
4 the The lazy bureaucrat problem (LBP) is a scheduling problem (common arrivals and deadlines) in which a set of jobs has to be scheduled in the most inefficient way! Definition The lazy bureaucrat needs to choose a subset of jobs to execute in a single day, in a such a way that: no other job fits in his/her working hours the total profit of selected jobs (e.g., their duration) is minimized
5 Applications of the the Practical point of view how to distribute the available budget so that: (i) the minimal amount of money is allocated to funding requests and (ii) while having a good excuse that no additional funds can be granted without violating the available budget? Theoretical point of view new interesting insights as the optimization is driven in the opposite direction when compared to their standard (non-lazy) counterparts
6 Applications of the the Practical point of view how to distribute the available budget so that: (i) the minimal amount of money is allocated to funding requests and (ii) while having a good excuse that no additional funds can be granted without violating the available budget? Theoretical point of view new interesting insights as the optimization is driven in the opposite direction when compared to their standard (non-lazy) counterparts
7 Mathematical definition the Definition (LBP with common arrivals and deadlines) We are given: a set of jobs I = {1,..., n} each job i I has a duration w i N and a profit p i N all jobs arrive at the same time all jobs have a common deadline C N The goal is to find a least profitable subset of jobs S I such that: S = arg min { p i w i C and w i + w j > C, j S} S I i S i S i S time-spent objective (p i = w i ). min-number-of-jobs objective (p i = 1). general objective function weighted-sum
8 Mathematical definition the Definition (LBP with common arrivals and deadlines) We are given: a set of jobs I = {1,..., n} each job i I has a duration w i N and a profit p i N all jobs arrive at the same time all jobs have a common deadline C N The goal is to find a least profitable subset of jobs S I such that: S = arg min { p i w i C and w i + w j > C, j S} S I i S i S i S time-spent objective (p i = w i ). min-number-of-jobs objective (p i = 1). general objective function weighted-sum
9 Mathematical definition the Definition (LBP with common arrivals and deadlines) We are given: a set of jobs I = {1,..., n} each job i I has a duration w i N and a profit p i N all jobs arrive at the same time all jobs have a common deadline C N The goal is to find a least profitable subset of jobs S I such that: S = arg min { p i w i C and w i + w j > C, j S} S I i S i S i S time-spent objective (p i = w i ). min-number-of-jobs objective (p i = 1). general objective function weighted-sum
10 Complexity issues the The problem has been introduced in [1] where it was shown that a more general problem variant with individual arrival times and deadlines is NP-hard For the problem variant with common arrival times and deadlines, [3] show that the problem is weakly NP-hard the min-number-of-jobs objective by reduction from subset-sum. Thus, the problem studied in this paper (with the more general weighted-sum objective) is also at least weakly NP-hard. In [5] a FPTAS have been proposed the time-spent objective with common arrival and deadlines. Property The weighted-sum lazy bureaucrat problem with common arrivals and deadlines is weakly NP-hard
11 Relationship with the Knapsack the the LBP can be seen as the problem of packing a set of items in a knapsack in a most inefficient but feasible way jobs of I are the items job durations w i are the item weights job profits p i are the item profits the deadline C is the budget or capacity. Notation and preprocessing items sorted in non-decreasing lexicographic order: non-decreasing weights w 1 w 2 w n non-decreasing profits p i C i := C w i, C 1 C 2... C n. w max := max i I w i (= w n) w min := min i I w i (= w 1 ) W := i I w i P := i I p i
12 the SOLUTION PROPERTIES
13 Solution Properties the Definition (Maximal Knapsack Packing) A packing P is a set of items, with the property i P w i C, i.e., a subset of items, which does not exceed the capacity C. Property A packing P is called maximal, iff P {i} is not a packing any i P. Each feasible LBP solution corresponds to a maximal feasible packing of the knapsack with capacity C. Property The capacity used by an arbitrary feasible solution S is bounded from below by C w max + 1.
14 Solution Properties the Definition (Maximal Knapsack Packing) A packing P is a set of items, with the property i P w i C, i.e., a subset of items, which does not exceed the capacity C. Property A packing P is called maximal, iff P {i} is not a packing any i P. Each feasible LBP solution corresponds to a maximal feasible packing of the knapsack with capacity C. Property The capacity used by an arbitrary feasible solution S is bounded from below by C w max + 1.
15 Solution Properties the Definition (Maximal Knapsack Packing) A packing P is a set of items, with the property i P w i C, i.e., a subset of items, which does not exceed the capacity C. Property A packing P is called maximal, iff P {i} is not a packing any i P. Each feasible LBP solution corresponds to a maximal feasible packing of the knapsack with capacity C. Property The capacity used by an arbitrary feasible solution S is bounded from below by C w max + 1.
16 Solution Properties the Definition (Maximal Knapsack Packing) A packing P is a set of items, with the property i P w i C, i.e., a subset of items, which does not exceed the capacity C. Property A packing P is called maximal, iff P {i} is not a packing any i P. Each feasible LBP solution corresponds to a maximal feasible packing of the knapsack with capacity C. Property The capacity used by an arbitrary feasible solution S is bounded from below by C w max + 1.
17 Critical Item (i) the We can only consider the minimum weight item outside the knapsack! Definition (Critical Weight and Critical Item.) i c = arg min{i I j i w j > C} the index of a critical item is the index of the first item that exceeds the capacity, assuming all i i c will be taken as well. The critical weight (w c) is the weight of the critical item (w c = w ic ). Items after the critical cannot be minimum weight item outside!
18 Critical Item (i) the We can only consider the minimum weight item outside the knapsack! Definition (Critical Weight and Critical Item.) i c = arg min{i I j i w j > C} the index of a critical item is the index of the first item that exceeds the capacity, assuming all i i c will be taken as well. The critical weight (w c) is the weight of the critical item (w c = w ic ). Items after the critical cannot be minimum weight item outside!
19 Critical Item (ii) the Proposition The weight of the smallest item left out of any feasible LBP solution is bounded above by the critical weight w c, i.e.: S is feasible min i S w i w c. Consequently, the size of the knapsack can be bounded from below as: w(s) C w c + 1. Example Weights(=profits) {1, 2, 2, 3, 3, 3, 4, 5} and C = 6; i c = 4 and w c = 3
20 Critical Item (ii) the Proposition The weight of the smallest item left out of any feasible LBP solution is bounded above by the critical weight w c, i.e.: S is feasible min i S w i w c. Consequently, the size of the knapsack can be bounded from below as: w(s) C w c + 1. Example Weights(=profits) {1, 2, 2, 3, 3, 3, 4, 5} and C = 6; i c = 4 and w c = 3
21 Main Observation the Observation Once, the smallest item left out of the solution is known, the problem reduces to solving the knapsack problem with a lower and upper bound on its capacity (LU-KP) If items are sorted in non-increasing order acc. to w i and i is the smallest item outside: (KP i ) J = arg min { p j + P i C w i W i + 1 w j C W i } J {i+1,...,n} j J j J Based on it: FPTAS [5] Dynamic Programming We have a new O(nC) approach! ILP Models Subject of this talk! CP Models Combinatorial lower bounds
22 Main Observation the Observation Once, the smallest item left out of the solution is known, the problem reduces to solving the knapsack problem with a lower and upper bound on its capacity (LU-KP) If items are sorted in non-increasing order acc. to w i and i is the smallest item outside: (KP i ) J = arg min { p j + P i C w i W i + 1 w j C W i } J {i+1,...,n} j J j J Based on it: FPTAS [5] Dynamic Programming We have a new O(nC) approach! ILP Models Subject of this talk! CP Models Combinatorial lower bounds
23 the ILP FORMULATIONS
24 ILP Formulation 1 the (ILP 1 ) j I,j i min p i x i i I w i x i C (0.1) i I w j x j + w i (1 x i ) (C + 1)(1 x i ) i I : i i c (0.2) x i {0, 1} i I Constraint (0.2) can be rewritten as w j x j (C i + 1)(1 x i ) i I : i i c. j I,j i where C i = C w i.
25 ILP Formulation 1 the (ILP 1 ) j I,j i min p i x i i I w i x i C (0.1) i I w j x j + w i (1 x i ) (C + 1)(1 x i ) i I : i i c (0.2) x i {0, 1} i I Constraint (0.2) can be rewritten as w j x j (C i + 1)(1 x i ) i I : i i c. j I,j i where C i = C w i.
26 Strengthening Covering Inequalities the Let ( a fixed i I) C = { C i + 1, C c + 1, i i c otherwise Proposition For a given i I, coefficients of the associated covering inequalities w j x j + (C i + 1)x i C i + 1 j I,j i can be down-lifted to k I α kx k C where { min{w c, α k := C}, k = i min{w k, C}, otherwise k I Global covering constraint: w i x i C c + 1 (C c = C w c.) (0.3) j I
27 (ILP 1 ): s the (ILP 1 ) Basic (ILP l 1) Lifted Variant In both cases: Branch-and-Cut approach - capacity constraints are separated on the fly
28 ILP Formulation 2 the (ILP 2 ) min p i x i i I w i x i C (0.4) i I w i x i + z C + 1 (0.5) i I z w c (w c w i )(1 x i ) i I, i i c (0.6) x {0, 1}, z N i I a single additional variable, but significantly simplified structure.
29 Formulations structures the Cap 9 x 1 x 2 x 3 x 4 x 5 z p i w i sol OPT LP ILP ILP l ILP Model I Model II
30 the IS THERE A CONNECTION BETWEEN ILP 1 and ILP 2?
31 A (not so) surprising result! the Proposition Benderization of ILP 2 : Projecting out z variables from ILP 2 results in the mulation ILP 1 in which constraints (0.2) are down-lifted as follows: w j x j + w cx i C + 1 w i Corollary j I,j i If min{w k, C + 1 w i } = w k, all k, i I, then the LP-relaxations of ILP l 1 and ILP 2 are the same. Observation If i, k s.t. w k + w i > C + 1 ILP l 1 can still be stronger than ILP 2 : coefficients next to x j, j i are not down-lifted!
32 A (not so) surprising result! the Proposition Benderization of ILP 2 : Projecting out z variables from ILP 2 results in the mulation ILP 1 in which constraints (0.2) are down-lifted as follows: w j x j + w cx i C + 1 w i Corollary j I,j i If min{w k, C + 1 w i } = w k, all k, i I, then the LP-relaxations of ILP l 1 and ILP 2 are the same. Observation If i, k s.t. w k + w i > C + 1 ILP l 1 can still be stronger than ILP 2 : coefficients next to x j, j i are not down-lifted!
33 A (not so) surprising result! the Proposition Benderization of ILP 2 : Projecting out z variables from ILP 2 results in the mulation ILP 1 in which constraints (0.2) are down-lifted as follows: w j x j + w cx i C + 1 w i Corollary j I,j i If min{w k, C + 1 w i } = w k, all k, i I, then the LP-relaxations of ILP l 1 and ILP 2 are the same. Observation If i, k s.t. w k + w i > C + 1 ILP l 1 can still be stronger than ILP 2 : coefficients next to x j, j i are not down-lifted!
34 the COMPUTATIONAL STUDY
35 Instances the classical instance generator 0/1 KP described in [6] two values: R {1000, 10000} small: n {10, 20, 30, 40, 50, 100, 500, 1000, 2000}, large: n {7500, 10000, 15000, 20000} C {25%, 50%, 75%} of total weight 9 different groups, each with 54 instances in total
36 Instances the 1 Uncorrelated: w j u.r. in [1, R], p j u.r. in [1, R]. 2 Weakly correlated: w j u.r. in [1, R], p j u.r. in [w j R/10, w j + R/10] so that p j 1. 3 Strongly correlated: w j u.r. in [1, R], p j = w j + R/10. 4 Inverse strongly correlated: p j u.r. in [1, R], w j = p j + R/10. 5 Almost strongly correlated: w j u.r. in[1, R], p j u.r. in [w j +R/10 R/500, w j +R/10+R/500]. 6 Subset-sum: w j u.r. in [1, R], p j = w j. 7 Even-odd subset-sum: w j even value u.r. in [1, R], p j = w j, c odd. 8 Even-odd strongly correlated: w j even value u.r. in [1, R], p j = w j + R/10, c odd. 9 Uncorrelated with similar weights: w j u.r. in [100 R, 100 R + R/10], p j u.r. in [1, R].
37 Greedy Heuristics the Table : Average percentage gaps from best known solutions by greedy heuristics. Class Algorithm avg Greedy heuristics greedy[1/p j ] greedy[1/w j ] greedy[w j /p j ] greedy[1/(p j w j )] greedy[1/(p j + w j )] greedy[p j /w j ] greedy-comb Observe: sorting according to w j /p j perms the best, on average, which is also intuitive (we prefer items with low profit and high weight).
38 Formulation relative strength the Table : Average percentage gaps of the different linear programming relaxations. Class Algorithm avg Linear Relaxation ILP ILP l ILP Lifting significantly reduces the LP-gap of (ILP 1 ) (ILP 2 ) provides very strong lower bounds, comparable to those obtained after lifting (ILP 1 ). The first class of instances (uncorrelated weights and profits) is by far the most difficult one, with average LP-gaps of more than 13% all ILP mulations.
39 Formulation Comparison: Over all classes (small) the ILP 1 ILP 2 DP Items ILP 1 ILP l 1 B&C Avg t[sec.s] AVG # of TL
40 Formulation Comparison the Avg t[sec.s] Table : Class # of TL Items ILP l 1 ILP 2 DP ILP l 1 ILP 2 DP
41 Formulation Comparison the Avg t[sec.s] Table : Class # of TL Items ILP l 1 ILP 2 DP ILP l 1 ILP 2 DP
42 Formulation Comparison the Avg t[sec.s] Table : Class # of TL Items ILP l 1 ILP 2 DP ILP l 1 ILP 2 DP
43 the
44 Recap and future developments the We studied ILP and DP approaches solving the LBP problem to optimality. ILP l 1 can be obtained by Benderization of ILP 2 Our computational study showed that the LBP is more difficult than the KP: the latter, instances with several thousands of items can be easily solved, while the LBP, a few thousands items make the problem difficult. Greedy Boss: Find a most profitable subset of jobs S to be executed so that the schedule exceeds the deadline, but after removing any of the scheduled jobs, the deadline is respected. solution properties, valid inequalities, solution approaches vs Greedy Boss Games!
45 Recap and future developments the We studied ILP and DP approaches solving the LBP problem to optimality. ILP l 1 can be obtained by Benderization of ILP 2 Our computational study showed that the LBP is more difficult than the KP: the latter, instances with several thousands of items can be easily solved, while the LBP, a few thousands items make the problem difficult. Greedy Boss: Find a most profitable subset of jobs S to be executed so that the schedule exceeds the deadline, but after removing any of the scheduled jobs, the deadline is respected. solution properties, valid inequalities, solution approaches vs Greedy Boss Games!
46 References the E. M. Arkin, M. A. Bender, J. S. Mitchell, and S. S. Skiena. The lazy bureaucrat scheduling problem. Inmation and, 184(1): , J. Boyar, L. Epstein, L. M. Favrholdt, J. S. Kohrt, K. S. Larsen, M. M. Pedersen, and S. Wøhlk. The maximum resource bin packing problem. Theoretical Computer Science, 362(1 3): , L. Gai and G. Zhang. On lazy bureaucrat scheduling with common deadlines. Journal of Combinatorial Optimization, 15(2): , D. Pisinger. David Pisinger s optimization codes, L. Gourvés, J. Monnot, and A. T. Pagourtzis. The lazy bureaucrat problem with common arrivals and deadlines: Approximation and mechanism design. In L. Gasieniec and F. Wolter, editors, Fundamentals of Theory, volume 8070 of Lecture Notes in Computer Science, pages Springer Berlin Heidelberg, S. Martello, D. Pisinger, and P. Toth. Dynamic programming and strong bounds the 0-1 knapsack problem. Management Science, 45: , 1999.
A Lazy Bureaucrat Scheduling Game
A Lazy Bureaucrat Scheduling Game Ling Gai Tianjin University Department of Mathematics No. 92 Weijin Road, Nankai District, Tianjin China gailing@tju.edu.cn Yuanchun Song Tianjin University Department
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
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 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 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 informationAlgorithms. Outline! Approximation Algorithms. The class APX. The intelligence behind the hardware. ! Based on
6117CIT - Adv Topics in Computing Sci at Nathan 1 Algorithms The intelligence behind the hardware Outline! Approximation Algorithms The class APX! Some complexity classes, like PTAS and FPTAS! Illustration
More informationa 1 a 2 a 3 a 4 v i c i c(a 1, a 3 ) = 3
AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 17 March 30th 1 Overview In the previous lecture, we saw examples of combinatorial problems: the Maximal Matching problem and the Minimum
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 informationThe Core Concept for the Multidimensional Knapsack Problem
The Core Concept for the Multidimensional Knapsack Problem Jakob Puchinger 1, Günther R. Raidl 1, and Ulrich Pferschy 2 1 Institute of Computer Graphics and Algorithms Vienna University of Technology,
More informationCommon-Deadline Lazy Bureaucrat Scheduling Problems
Common-Deadline Lazy Bureaucrat Scheduling Problems Behdad Esfahbod, Mohammad Ghodsi, and Ali Sharifi Computer Engineering Department Sharif University of Technology, Tehran, Iran, {behdad,ghodsi}@sharif.edu,
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationThe Knapsack Problem. n items with weight w i N and profit p i N. Choose a subset x of items
Sanders/van Stee: Approximations- und Online-Algorithmen 1 The Knapsack Problem 10 15 W n items with weight w i N and profit p i N Choose a subset x of items Capacity constraint i x w i W wlog assume i
More informationThe sharpest column: stabilizing column generation for the bin packing problem via a lexicographic pricer
The sharpest column: stabilizing column generation for the bin packing problem via a lexicographic pricer Stefano Coniglio University of Southampton University Road, SO17 1BJ, Southampton, UK Fabio D Andreagiovanni
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 15: The Greedy Heuristic Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/ School of
More informationThe Multidimensional Knapsack Problem: Structure and Algorithms
The Multidimensional Knapsack Problem: Structure and Algorithms Jakob Puchinger NICTA Victoria Laboratory Department of Computer Science & Software Engineering University of Melbourne, Australia jakobp@csse.unimelb.edu.au
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 informationSEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE VERY LARGE INSTANCES
SEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE VERY LARGE INSTANCES PH. BAPTISTE, F. DELLA CROCE, A. GROSSO, AND V. T KINDT Abstract. We consider the problem of
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 informationMinimizing the Number of Tardy Jobs
Minimizing the Number of Tardy Jobs 1 U j Example j p j d j 1 10 10 2 2 11 3 7 13 4 4 15 5 8 20 Ideas: Need to choose a subset of jobs S that meet their deadlines. Schedule the jobs that meet their deadlines
More informationA Heuristic Algorithm for General Multiple Nonlinear Knapsack Problem
A Heuristic Algorithm for General Multiple Nonlinear Knapsack Problem Luca Mencarelli mencarelli@lix.polytechnique.fr Poster Session: Oral Presentations Mixed-Integer Nonlinear Programming 2014 Carnegie
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 informationRecoverable Robust Knapsacks: Γ -Scenarios
Recoverable Robust Knapsacks: Γ -Scenarios Christina Büsing, Arie M. C. A. Koster, and Manuel Kutschka Abstract In this paper, we investigate the recoverable robust knapsack problem, where the uncertainty
More informationOn Two Class-Constrained Versions of the Multiple Knapsack Problem
On Two Class-Constrained Versions of the Multiple Knapsack Problem Hadas Shachnai Tami Tamir Department of Computer Science The Technion, Haifa 32000, Israel Abstract We study two variants of the classic
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 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 informationCS6999 Probabilistic Methods in Integer Programming Randomized Rounding Andrew D. Smith April 2003
CS6999 Probabilistic Methods in Integer Programming Randomized Rounding April 2003 Overview 2 Background Randomized Rounding Handling Feasibility Derandomization Advanced Techniques Integer Programming
More informationAn efficient implementation for the 0-1 multi-objective knapsack problem
An efficient implementation for the 0-1 multi-objective knapsack problem Cristina Bazgan, Hadrien Hugot, and Daniel Vanderpooten LAMSADE, Université Paris Dauphine, Place Du Maréchal De Lattre de Tassigny,
More informationA Hub Location Problem with Fully Interconnected Backbone and Access Networks
A Hub Location Problem with Fully Interconnected Backbone and Access Networks Tommy Thomadsen Informatics and Mathematical Modelling Technical University of Denmark 2800 Kgs. Lyngby Denmark tt@imm.dtu.dk
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 informationInteger Optimization with Penalized Fractional Values: The Knapsack Case
Integer Optimization with Penalized Fractional Values: The Knapsack Case Enrico Malaguti 1, Michele Monaci 1, Paolo Paronuzzi 1, and Ulrich Pferschy 2 1 DEI, University of Bologna, Viale Risorgimento 2,
More informationCSE 421 Dynamic Programming
CSE Dynamic Programming Yin Tat Lee Weighted Interval Scheduling Interval Scheduling Job j starts at s(j) and finishes at f j and has weight w j Two jobs compatible if they don t overlap. Goal: find maximum
More informationKnapsack and Scheduling Problems. The Greedy Method
The Greedy Method: Knapsack and Scheduling Problems The Greedy Method 1 Outline and Reading Task Scheduling Fractional Knapsack Problem The Greedy Method 2 Elements of Greedy Strategy An greedy algorithm
More informationTheoretical Computer Science
Theoretical Computer Science 411 (010) 417 44 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: wwwelseviercom/locate/tcs Resource allocation with time intervals
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 informationInverse Median Location Problems with Variable Coordinates. Fahimeh Baroughi Bonab, Rainer Ernst Burkard, and Behrooz Alizadeh
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung Inverse Median Location Problems with Variable Coordinates Fahimeh Baroughi Bonab, Rainer
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 informationThe Knapsack Problem. 28. April /44
The Knapsack Problem 20 10 15 20 W n items with weight w i N and profit p i N Choose a subset x of items Capacity constraint i x w i W wlog assume i w i > W, i : w i < W Maximize profit i x p i 28. April
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 informationCOSC 341: Lecture 25 Coping with NP-hardness (2)
1 Introduction Figure 1: Famous cartoon by Garey and Johnson, 1979 We have seen the definition of a constant factor approximation algorithm. The following is something even better. 2 Approximation Schemes
More informationKnapsack problem with objective value gaps
Knapsack problem with objective value gaps Alexandre Dolgui, Mikhail Y. Kovalyov, Alain Quilliot To cite this version: Alexandre Dolgui, Mikhail Y. Kovalyov, Alain Quilliot. Knapsack problem with objective
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 informationMachine scheduling with resource dependent processing times
Mathematical Programming manuscript No. (will be inserted by the editor) Alexander Grigoriev Maxim Sviridenko Marc Uetz Machine scheduling with resource dependent processing times Received: date / Revised
More informationImproved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem
Improved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem Mukul Subodh Bansal V.Ch.Venkaiah International Institute of Information Technology Hyderabad, India Abstract
More informationMVE165/MMG630, Applied Optimization Lecture 6 Integer linear programming: models and applications; complexity. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming: models and applications; complexity Ann-Brith Strömberg 2011 04 01 Modelling with integer variables (Ch. 13.1) Variables Linear programming (LP) uses continuous
More informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
More informationA Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science February 2006 A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
More informationScheduling Parallel Jobs with Linear Speedup
Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl
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 informationSurrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems Audrey Cerqueus, Anthony Przybylski, Xavier Gandibleux Université de Nantes LINA UMR CNRS 624 UFR sciences 2 Rue de la
More informationLinear Programming. Linear Programming I. Lecture 1. Linear Programming. Linear Programming
Linear Programming Linear Programming Lecture Linear programming. Optimize a linear function subject to linear inequalities. (P) max " c j x j n j= n s. t. " a ij x j = b i # i # m j= x j 0 # j # n (P)
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 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 informationQuadratic Multiple Knapsack Problem with Setups and a Solution Approach
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Quadratic Multiple Knapsack Problem with Setups and a Solution Approach
More informationThe two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles
INFORMS Journal on Computing Vol. 19, No. 1, Winter 2007, pp. 36 51 issn 1091-9856 eissn 1526-5528 07 1901 0036 informs doi 10.1287/ijoc.1060.0181 2007 INFORMS Using Decomposition Techniques and Constraint
More informationApproximation Basics
Approximation Basics, Concepts, and Examples Xiaofeng Gao Department of Computer Science and Engineering Shanghai Jiao Tong University, P.R.China Fall 2012 Special thanks is given to Dr. Guoqiang Li for
More informationCO759: Algorithmic Game Theory Spring 2015
CO759: Algorithmic Game Theory Spring 2015 Instructor: Chaitanya Swamy Assignment 1 Due: By Jun 25, 2015 You may use anything proved in class directly. I will maintain a FAQ about the assignment on the
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationA 0-1 KNAPSACK PROBLEM CONSIDERING RANDOMNESS OF FUTURE RETURNS AND FLEXIBLE GOALS OF AVAILABLE BUDGET AND TOTAL RETURN
Scientiae Mathematicae Japonicae Online, e-2008, 273 283 273 A 0-1 KNAPSACK PROBLEM CONSIDERING RANDOMNESS OF FUTURE RETURNS AND FLEXIBLE GOALS OF AVAILABLE BUDGET AND TOTAL RETURN Takashi Hasuike and
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 informationCS 6783 (Applied Algorithms) Lecture 3
CS 6783 (Applied Algorithms) Lecture 3 Antonina Kolokolova January 14, 2013 1 Representative problems: brief overview of the course In this lecture we will look at several problems which, although look
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 informationOptimization Exercise Set n.5 :
Optimization Exercise Set n.5 : Prepared by S. Coniglio translated by O. Jabali 2016/2017 1 5.1 Airport location In air transportation, usually there is not a direct connection between every pair of airports.
More information0-1 Knapsack Problem
KP-0 0-1 Knapsack Problem Define object o i with profit p i > 0 and weight w i > 0, for 1 i n. Given n objects and a knapsack capacity C > 0, the problem is to select a subset of objects with largest total
More informationCS 6901 (Applied Algorithms) Lecture 3
CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar
More informationIntroduction column generation
Introduction column generation Han Hoogeveen Institute of Information and Computing Sciences University Utrecht The Netherlands May 28, 2018 Contents Shadow prices Reduced cost Column generation Example:
More informationThe knapsack problem
Moderne Suchmethoden der Informatik The knapsack problem Florian Pawlik December 1, 2014 Abstract Have you ever wondered about how heavy one can fill his knapsack? No? That does not matter You will get
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 informationLINEAR PROGRAMMING I. a refreshing example standard form fundamental questions geometry linear algebra simplex algorithm
Linear programming Linear programming. Optimize a linear function subject to linear inequalities. (P) max c j x j n j= n s. t. a ij x j = b i i m j= x j 0 j n (P) max c T x s. t. Ax = b Lecture slides
More informationMachine Minimization for Scheduling Jobs with Interval Constraints
Machine Minimization for Scheduling Jobs with Interval Constraints Julia Chuzhoy Sudipto Guha Sanjeev Khanna Joseph (Seffi) Naor Abstract The problem of scheduling jobs with interval constraints is a well-studied
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 informationEfficient approximation algorithms for the Subset-Sums Equality problem
Efficient approximation algorithms for the Subset-Sums Equality problem Cristina Bazgan 1 Miklos Santha 2 Zsolt Tuza 3 1 Université Paris-Sud, LRI, bât.490, F 91405 Orsay, France, bazgan@lri.fr 2 CNRS,
More informationLecture slides by Kevin Wayne
LINEAR PROGRAMMING I a refreshing example standard form fundamental questions geometry linear algebra simplex algorithm Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM Linear programming
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 informationCentre d Economie de la Sorbonne UMR 8174
Centre d Economie de la Sorbonne UMR 8174 On-line bin-packing problem : maximizing the number of unused bins Bernard KOUAKOU Marc DEMANGE Eric SOUTIF 2006.38 Maison des Sciences Économiques, 106-112 boulevard
More informationCS320 The knapsack problem
CS320 The knapsack problem 1 Search and Discrete Optimization Discrete Optimization Problem (S,f) S: space of feasible solutions (satisfying some constraints) f : S R function that maps all feasible solutions
More informationLP based heuristics for the multiple knapsack problem. with assignment restrictions
LP based heuristics for the multiple knapsack problem with assignment restrictions Geir Dahl and Njål Foldnes Centre of Mathematics for Applications and Department of Informatics, University of Oslo, P.O.Box
More information1 The Knapsack Problem
Comp 260: Advanced Algorithms Prof. Lenore Cowen Tufts University, Spring 2018 Scribe: Tom Magerlein 1 Lecture 4: The Knapsack Problem 1 The Knapsack Problem Suppose we are trying to burgle someone s house.
More informationThe Off-line Group Seat Reservation Problem
The Off-line Group Seat Reservation Problem Tommy Clausen, Allan Norlunde Hjorth, Morten Nielsen, David Pisinger Technical Report no. 07/02 ISSN: 0107-8283 Dept. of Computer Science University of Copenhagen
More informationGreedy vs Dynamic Programming Approach
Greedy vs Dynamic Programming Approach Outline Compare the methods Knapsack problem Greedy algorithms for 0/1 knapsack An approximation algorithm for 0/1 knapsack Optimal greedy algorithm for knapsack
More informationThe Maximum Resource Bin Packing Problem
The Maximum Resource Bin Pacing Problem Joan Boyar Leah Epstein Lene M. Favrholdt Jens S. Kohrt Kim S. Larsen Morten M. Pedersen Sanne Wøhl 3 Department of Mathematics and Computer Science University of
More informationCS 598RM: Algorithmic Game Theory, Spring Practice Exam Solutions
CS 598RM: Algorithmic Game Theory, Spring 2017 1. Answer the following. Practice Exam Solutions Agents 1 and 2 are bargaining over how to split a dollar. Each agent simultaneously demands share he would
More informationOrbital Shrinking: A New Tool for Hybrid MIP/CP Methods
Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods Domenico Salvagnin DEI, University of Padova salvagni@dei.unipd.it Abstract. Orbital shrinking is a newly developed technique in the MIP community
More informationWeek Cuts, Branch & Bound, and Lagrangean Relaxation
Week 11 1 Integer Linear Programming This week we will discuss solution methods for solving integer linear programming problems. I will skip the part on complexity theory, Section 11.8, although this is
More informationWhere are the hard knapsack problems?
Computers & Operations Research 32 (2005) 2271 2284 www.elsevier.com/locate/dsw Where are the hard knapsack problems? David Pisinger Department of Computer Science, University of Copenhagen, Universitetsparken
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 informationA PTAS for the Uncertain Capacity Knapsack Problem
Clemson University TigerPrints All Theses Theses 12-20 A PTAS for the Uncertain Capacity Knapsack Problem Matthew Dabney Clemson University, mdabney@clemson.edu Follow this and additional works at: https://tigerprints.clemson.edu/all_theses
More informationScheduling Coflows in Datacenter Networks: Improved Bound for Total Weighted Completion Time
1 1 2 Scheduling Coflows in Datacenter Networs: Improved Bound for Total Weighted Completion Time Mehrnoosh Shafiee and Javad Ghaderi Abstract Coflow is a recently proposed networing abstraction to capture
More informationApproximation Algorithms for Scheduling with Reservations
Approximation Algorithms for Scheduling with Reservations Florian Diedrich 1,,, Klaus Jansen 1,, Fanny Pascual 2, and Denis Trystram 2, 1 Institut für Informatik, Christian-Albrechts-Universität zu Kiel,
More informationLogic-based Benders Decomposition
Logic-based Benders Decomposition A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Logic-based Benders Decomposition June 29 July 1 2 / 15 Basic idea
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 informationUniversity of Groningen. The binary knapsack problem Ghosh, Diptesh; Goldengorin, Boris
University of Groningen The binary knapsack problem Ghosh, Diptesh; Goldengorin, Boris IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it.
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 informationEnergy-efficient Mapping of Big Data Workflows under Deadline Constraints
Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Presenter: Tong Shu Authors: Tong Shu and Prof. Chase Q. Wu Big Data Center Department of Computer Science New Jersey Institute
More informationInteger Linear Programs
Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens
More informationFundamentals of optimization problems
Fundamentals of optimization problems Dmitriy Serdyuk Ferienakademie in Sarntal 2012 FAU Erlangen-Nürnberg, TU München, Uni Stuttgart September 2012 Overview 1 Introduction Optimization problems PO and
More informationInteger Solutions to Cutting Stock Problems
Integer Solutions to Cutting Stock Problems L. Fernández, L. A. Fernández, C. Pola Dpto. Matemáticas, Estadística y Computación, Universidad de Cantabria, 39005 Santander, Spain, laura.fernandezfern@alumnos.unican.es,
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 informationSolutions to Exercises
1/13 Solutions to Exercises The exercises referred to as WS 1.1(a), and so forth, are from the course book: Williamson and Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011,
More informationKNAPSACK PROBLEMS WITH SETUPS
7 e Conférence Francophone de MOdélisation et SIMulation - MOSIM 08 - du 31 mars au 2 avril 2008 - Paris - France Modélisation, Optimisation et Simulation des Systèmes : Communication, Coopération et Coordination
More informationOpen Problems in Throughput Scheduling
Open Problems in Throughput Scheduling Jiří Sgall Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Malostranské nám. 25, CZ-11800 Praha 1, Czech Republic. sgall@iuuk.mff.cuni.cz
More information