A Note on the Bertsimas & Sim Algorithm for Robust Combinatorial Optimization Problems
|
|
- Aubrie Briggs
- 7 years ago
- Views:
Transcription
1 myjournal manuscript No. (will be inserted by the editor) A Note on the Bertsimas & Sim Algorithm for Robust Combinatorial Optimization Problems Eduardo Álvarez-Miranda Ivana Ljubić Paolo Toth Received: date / Accepted: date Abstract We improve the well-known result of Bertsimas and Sim presented in (D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Mathematical Programg, B(98): 49-71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty. Keywords Robust Combinatorial Optimization Problems Bertsimas & Sim Algorithm. 1. Introduction and Motivation We address a general class of Combinatorial Optimization problems in which both the objective function coefficients and the constraint coefficients are subject to interval uncertainty. When uncertainty has to be taken into consideration, Robust Optimization (RO) arises as methodological alternative to deal with it. The Bertsimas & Sim Robust (B&S) Optimization approach, introduced in [Bertsimas and Sim(2003)], is one of the most important approaches devised to incorporate this E. Álvarez-Miranda, P. Toth DEIS, Università di Bologna Viale Risorgimento 2, Bologna, Italy {e.alvarez,paolo.toth}@unibo.it I. Ljubić Department of Statistics and Operations Research, Faculty of Business, Economics, and Statistics, University of Vienna Brünnerstraße 72 A-1210 Vienna, Austria Tel: Fax: ivana.ljubic@univie.ac.at
2 2 Eduardo Álvarez-Miranda et al. type of uncertainty into the decision process. By means of protection functions, the obtained solutions are endowed with protection, i.e., they are robust, in terms of feasibility and/or optimality for a given level of conservatism denoted by a parameter Γ X, defined by the decision maker. When the coefficients associated with a set of n variables are subject to uncertainty, the level of conservatism is interpreted as the number of coefficients that are expected to present uncertainty, i.e., 0 < Γ X n. For the case that the uncertain coefficients are only present in the objective function, a wellknown result of [Bertsimas and Sim(2003)] states that the robust counterpart of the problem can be computed by solving at most n + 1 instances of the original deteristic problem. Thus, the robust counterpart of a polynomially solvable binary optimization problem remains polynomially solvable. Our Contribution In this paper we propose some improvements and extensions to the algorithmic result presented in [Bertsimas and Sim(2003)]. For the case studied in their paper, we show that instead of solving n + 1 deteristic problems, the robust counterpart can be computed by solving n Γ X + 2 deteristic problems (Lemma 1); this improvement is particularly interesting for those cases for which a high level of conservatism, i.e., a large value of Γ X, is suitable. Additionally, we show that if a knapsack-type constraint is part of a problem and m of its coefficients are affected by uncertainty, an equivalent algorithmic approach can be applied, and the robust counterpart can be computed by solving m Γ Y + 2 deteristic problems (Lemma 2), for 0 < Γ Y m. Likewise, we show that if the uncertain coefficients in the objective function are associated with two disjoint sets of variables, of size n and m respectively, the robust problem can be computed by solving of (n Γ X + 2)(m Γ Y + 2) deteristic problems (Lemma 3), giving to the decision maker the flexibility to define different levels of conservatism to different sets of uncertain parameters. A similar result is also shown for the case that uncertainty is present in a set of n objective function coefficients and in a set of m coefficients of a knapsack-type constraint (Lemma 4). Combining the previous results, we provide a more general result which considers the case in which the uncertain coefficients in the objective function are associated with K disjoint sets of variables and there are L knapsack-type constraints (each of them involving a different set of variables) with uncertain coefficients. For this type of problems, we show that the robust counterpart can be computed by solving a strongly-polynomial number of deteristic problems (Theorem 1), assug that K and L are constant. The presented results are important when solving robust counterparts of some well-known combinatorial optimization problems in which different levels of conservatism are associated to disjoint subsets of binary variables. For example, in Prize-Collecting Network Design Problems (PCNDPs) (e.g., TSP, Steiner Trees), binary variables are associated to edges and nodes of a graph, and we might associate different levels of conservatism to their corresponding coefficients, costs and prizes, respectively. Besides defining the objective function as the sum of edge costs and node prizes, PC- NDPs are frequently modeled using knapsack-type Budget or Quota constraints, and our results can be used in these cases as well, when the coefficients of these constraints are subject to interval uncertainty.
3 A Note on the Bertsimas & Sim Algorithm for Robust Combinatorial Optimization Problems 3 Similarly, in facility location problems, location and allocation decisions need to be taken. Each of these decisions involves disjoint sets of variables and, possibly uncertain, coefficients. In these conditions, different levels of conservatism might be suitable for different sets of coefficients. Other proent examples of problems that fall into this framework are generalizations of the vehicle routing problem, involving routing, assignment, location, inventory decision variables and more for solving the robust counterparts of these problems, the presented result can be used as well. The viability of the proposed methods strongly relies on the efficacy to solve the deteristic counterparts. 2. Main Results Let us consider the following generic Combinatorial Optimization problem with linear objective function and binary variables x {0, 1} n : { } OP T P 1 = c i x i x Π, (P1) where c 0, I = {1, 2,..., n} and Π is a generic polyhedral region. Let us assume now that instead of having known and deteristic parameters c i, i I, we are actually given uncertain intervals [c i, c i + d i ], i I. Assume that variables x are ordered so that d i d i+1, i I, and d n+1 = 0. For a given level of conservatism Γ X {1,..., n}, the robust formulation of (P1) is defined in [Bertsimas and Sim(2003)] as: { } ROP T P 1 (Γ X ) = c i x i + βx (Γ X, x) x Π, (RP1) where βx (Γ X, x) is the corresponding protection function defined as: { βx (Γ X, x) = max d i x i u i } u i Γ X and u i [0, 1] i I. (1) This protection function endows robustness to the solutions in terms of protection of optimality in presence of a given level of data uncertainty, represented by Γ X. In the context of RO, (P1) is referred to as the noal problem and (RP1) as the corresponding robust counterpart. After applying strong duality to (1), problem (RP1) can be rewritten as ROP T P 1 (Γ X ) = c i x i + Γ X θ + h i (2) s.t. h i + θ d i x i, i I (3) h i 0, i I and θ 0 (4) x Π. (5)
4 4 Eduardo Álvarez-Miranda et al. The previous formulation of the robust counterpart of (P1) has been presented in [Bertsimas and Sim(2003)] and the authors provide a combinatorial framework that computes ROP T P 1 (Γ X ) by solving n+1 noal problems (Theorem 3, p. 56). The following lemma provides an improvement to this result by reducing the number of iterations of the algorithmic procedure. Lemma 1 Given Γ X {1,..., n}, the problem (RP1), the robust counterpart of problem (P1), can be computed by solving (n Γ X + 2) noal problems in the following scheme: where for r {Γ X,..., n + 1}: ROP T P 1 (Γ X ) = G r = Γ X d r + r {Γ X,...,n+1} Gr, ( c i x i + ) r (d i d r ) x i. Proof. The first part of the proof consists of showing that any optimal solution (x, h, θ ) of (RP1) satisfies: θ [0, d ΓX ]. Given the structure of constraints h i + θ d i x i, i I, it follows that any optimal solution (x, h, θ ) satisfies: h i = max (d i x i θ, 0), and since x i {0, 1}, then it is true that max (d i x i θ, 0) = max (d i θ, 0) x i. Therefore, the objective function of (2)-(5) can be rewritten as ROP T P 1 (Γ X ) = c i x i + Γ X θ + max (d i θ, 0) x i. Let x be a feasible solution for a given Γ X. Let N x be the set of indices i I such that x i = 1. Let I(N x, Γ X ) be a subset of N x associated with (at most) the Γ X largest d i values. Let us assume that N x Γ X, then we have I(N x, Γ X ) = N x, which implies that the cost of each element corresponding to an index i N x will be set to its corresponding upper bound c i + d i. This means that if x is optimal, the imum value ROP T P 1 (Γ X ) can be calculated as i N x (c i + d i ), which implies that θ = d n+1 = 0. Let us now assume that N x Γ X + 1. Then, by definition, we have I(N x, Γ X ) = Γ X. Let r be the index of the Γ X -th largest d i value taken into the solution, i.e., r = max{i i I(N x, Γ X )}. Then we have: c i + d i = c i + i N x i N x (N x,γ X ) = i N x c i + = c i x i + {i N x:i r } {i N x:i r } r d i d r + {i N x:i r } {i N x:i r } (d i d r ) + Γ X d r (d i d r )x i + Γ X d r. d r
5 A Note on the Bertsimas & Sim Algorithm for Robust Combinatorial Optimization Problems 5 Note that r Γ X since N x Γ X +1. Therefore, the imum value ROP T P 1 (Γ X ) will be reached for θ = d r, where r Γ X, and hence, θ [0, d ΓX ], which completes the first part of the proof. We now present the second part of the proof, where the previous result is plugged into the procedure devised in [Bertsimas and Sim(2003)], and we find the optimal values of θ by using an equivalent decomposition approach. We decompose the real interval [0, d ΓX ] into [0, d n ], [d n, d n 1 ],..., [d ΓX +1, d ΓX ]. Observe that for an arbitrary θ [d r, d r 1 ] we have: r 1 max(d i θ, 0)x i = (d i θ)x i. Therefore, ROP T P 1 (Γ X ) = r {ΓX,...,n+1} G r where for r {Γ X,..., n + 1} G r = r 1 c i x i + Γ X θ + (d i θ) x i, where θ [d r, d r 1 ] and x Π. Since we are optimizing a linear function of θ over the interval [d r, d r 1 ], the optimal value of G r is obtained either by θ = d r or by θ = d r 1. So, for r {Γ X,..., n + 1}: r 1 c i x i + G r = Γ X d r + (d i d r) x i, Γ X d r 1 + = Γ X d r + r c i x i + (d i d r) x i, Γ X d r 1 + r 1 c i x i + r 1 c i x i + (d i d r 1 ) x i (d i d r 1 ) x i. Therefore, ROP T P 1 (Γ X ) = Γ X d ΓX + c i x i,..., Γ X d r + r c i x i + (d i d r) x i,..., c i x i + d i x i, which completes the proof. Consider now the following problem that we will refer to as (P2): OP T P 2 = c i x i b j y j B and (x, y) Ψ, (P2) where y {0, 1} m are decision variables, B R 0 is a constant, b 0, J = {1, 2,..., m}, and Ψ is a generic polyhedral region. Let us assume that c is known with certainty, but instead, the elements of b are given as uncertain intervals [b j, b j + δ j ], j J, and that the variables are ordered so that δ j δ j+1, j J, and δ m+1 = 0. Given Γ Y {1,..., m}, the robust counterpart of the noal problem (P2), given the interval uncertainty of vector b, is: ROP T P 2 (Γ Y ) = c i x i b j y j + βy (Γ Y, y) B and (x, y) Ψ. (RP2)
6 6 Eduardo Álvarez-Miranda et al. In this case, β Y (Γ Y, y) provides protection of feasibility in presence of a level of conservatism given by Γ Y. This problem can be rewritten as ROP T P 2 (Γ Y ) = c i x i (6) s.t b j y j + Γ Y λ + k j B (7) k j + λ δ j y j, j J (8) k j 0, j J and λ 0 (9) (x, y) Ψ. (10) The following lemma extends for (RP2) the result of Theorem 3 in [Bertsimas and Sim(2003)], and adapts the result of Lemma 1. Lemma 2 Given Γ Y {1,..., m}, the problem (RP2), the robust counterpart of problem (P2), can be computed by solving (m Γ Y + 2) noal problems, in the following scheme: where for s {Γ Y,..., m + 1}: H s = ROP T P 2 (Γ Y ) = c i x i b j y j + s {Γ Y,...,m+1} Hs, s (δ j δ s ) y j + Γ Y δ s B. Proof. The core of the proof consists of showing that for any feasible solution of (6)-(10) we have λ [0, δ ΓY ]. For any feasible solution of (6)-(10) holds that k j = max (δ j y j λ, 0) ; thus, constraint (7) can be written as b j y j + Γ Y λ + max (δ j λ, 0) y j B. (11) Let (x, y) be a feasible solution for a given Γ X and a given Γ Y. Let M y be a set of indices j J such that y j = 1. Let J(M y, Γ Y ) be a subset of M y associated with (at most) the Γ Y largest values δ j. Since (x, y) is a feasible solution, then the following holds: b j + j M y δ j B. (M y,γ Y ) Let us assume that M y Γ Y, then we have J(M y, Γ Y ) = M y, which implies that the cost of each element corresponding to index j M y will be set to its corresponding upper bound b j + δ j, and hence constraint (11) is satisfied for λ = d m+1 = 0.
7 A Note on the Bertsimas & Sim Algorithm for Robust Combinatorial Optimization Problems 7 Let us now assume that M y Γ Y + 1. Then, by definition, we have J(M y, Γ Y ) = Γ Y. Let s = max{j j J(M y, Γ Y )}. So b j + δ j = b j + j M y j M y (M y,γ Y ) = j M y b j + = b j y j + δ j δ s + {j M y:j s } {j M y:j s } s {j M y:j s } {j M y:j s } (δ j δ s ) + Γ Y δ s (δ j δ s )y j + Γ Y δ s B. Note that s Γ Y since M y Γ Y + 1, and therefore constraint (7) will be satisfied for all λ = δ s such that s Γ Y. Therefore for any feasible solution we have λ [0, δ ΓY ]. By following similar arguments as those presented in the decomposition approach of the proof of Lemma 1, it holds that ROP T P 2 (Γ Y ) = c i x i c i x i b j y j + Γ Y δ ΓY B,..., s b j y j + (δ j δ s ) y j + Γ Y δ s B,..., c i x i b j y j + δ j y j B, and the proof is completed. We now present a second extension of the algorithm proposed in [Bertsimas and Sim(2003)]. Let us consider now the following noal problem: OP T P 3 = c i x i + b j y j (x, y) Ψ. (P3) In case that the elements of both vectors c and b are given in terms of closed intervals, the corresponding robust counterpart (for a pair (Γ X, Γ Y )) is given by ROP T P 3 (Γ X, Γ Y ) = c i x i + Γ X θ + h i + b j y j + Γ Y λ + k j (12) δ s s.t. (3),(4),(8),(9) and (x, y) Ψ. (13) The following result extends Lemma 1 and provides an algorithmic procedure to solve (12)-(13). Lemma 3 Given Γ X {1,..., n} and Γ Y {1,..., m}, the robust counterpart of problem (P3) can be computed by solving (n Γ X + 2)(m Γ Y + 2) noal problems as follows: ROP T P 3 (Γ X, Γ Y ) = r {Γ X,...,n+1} s {Γ Y,...,m+1} G r,s,
8 8 Eduardo Álvarez-Miranda et al. where for r {Γ X,..., n + 1} and s {Γ Y,..., m + 1}: G r,s = Γ X d r + Γ Y δ s + r c i x i + (d i d r) x i + s b j y j + (δ j δ s) y j. Proof. Using an analogous analysis to the one in the proofs of Lemma 1 and 2, we have that for any optimal solution (x, y, θ, λ ), it holds θ [0, d ΓX ] and λ [0, d ΓY ]. Then, by decomposition, the optimum can be found as ROP T P 3 (Γ X, Γ Y ) = r {ΓX,...,n+1} G r,s where for r {Γ X,..., n + 1} s {Γ Y,...,m+1} and s {Γ Y,..., m + 1} G r,s = r 1 c i x i + Γ X θ + (d i θ) x i + s 1 b j y j + Γ Y λ + (δ j λ) y j, (14) for which θ [d r, d r 1 ], λ [δ s, δ s 1 ] and (x, y) Ψ. Since we are optimizing a linear function of θ over the interval [d r, d r 1 ] and also a linear function for λ over the interval [δ s, δ s 1 ], the optimal value of G r,s is obtained for (θ, λ) {(d r, δ s ), (d r 1, δ s ), (d r, δ s 1 ), (d r 1, δ s 1 )}. So, for r {Γ X,..., n + 1} and s {Γ Y,..., m + 1}: G r,s = Γ X d r + Γ Y δ s + Γ X d r 1 + Γ Y δ s + Γ X d r + Γ Y δ s 1 + r 1 c ix i + r 1 c ix i + r 1 c ix i + (d i d r) x i + s 1 b jy j + (δ j δ s) y j, (d i d r 1) x i + s 1 b jy j + (δ j δ s) y j, (d i d r) x i + s 1 b jy j + (δ j δ s 1) y j, r 1 c ix i + s 1 b jy j + (δ j δ s 1) y j Γ X d r 1 + Γ Y δ s 1 + (d i d r 1) x i + = Γ X d r + Γ Y δ s + r c ix i + (d i d r) x i + s b jy j + (δ j δ s) y j, Γ X d r 1 + Γ Y δ s + r 1 c ix i + (d i d r 1) x i + s b jy j + (δ j δ s) y j, Γ X d r + Γ Y δ s 1 + r c ix i + (d i d r) x i + s 1 b jy j + (δ j δ s 1) y j, Γ X d r 1 + Γ Y δ s 1 + r 1 c ix i + (d i d r 1) x i + s 1 b jy j + (δ j δ s 1) y j.
9 A Note on the Bertsimas & Sim Algorithm for Robust Combinatorial Optimization Problems 9 Therefore, ROP T P 3 (Γ X, Γ Y ) = Γ X d ΓX + Γ Y δ ΓY + c i x i + b j y j,..., Γ X d r + Γ Y δ s + r c i x i + (d i d r ) x i + s b j y j + (δ j δ s ) y j,..., c i x i + which completes the proof. d i x i + b j y j + δ j y j, As a complementary result, one can observe that if in (P2) the cost vector c is also subject to interval uncertainty (along with the coefficient vector b), the corresponding robust counterpart is given by ROP T P 4 (Γ X, Γ Y ) = c i x i + Γ X θ + h i (15) s.t. (3), (4), (7), (8), (9) and (x, y) Ψ. (16) Combining the results of Lemma 1 and 2, we have the following result, Lemma 4 Given Γ X {1,..., n} and Γ Y {1,..., m}, the robust problem (15)-(16) can be solved by solving (n Γ X + 2)(m Γ Y + 2) noal problems as follows: ROP T P 4 (Γ X, Γ Y ) = where for r {Γ X,..., n + 1} and s {Γ Y,..., m + 1}: r {Γ X,...,n+1} s {Γ Y,...,m+1} H r,s, H r,s = Γ X d r + r c i x i + (d i d r) x i s b j y j + (δ j δ s) y j + Γ Y δ s B. We omit the proof of this result as it follows from the proofs of Lemma 2 and General Result In light of Lemmas 3 and 4, we now generalize the previous results considering a more general Combinatorial Optimization problem under interval uncertainty and propose a combinatorial framework to solve its robust counterpart. Let us consider a case in which the set of binary variables is partitioned into K + L subsets given by (x 1,..., x K, y 1,..., y L ), associated with sets of indices (I 1,..., I K, J 1,..., J L ). Variables (x 1,..., x K ) appear in the objective function with non-negative cost vectors (c 1,..., c K ), and (y 1,..., y L ) variables appear in L disjoint knapsack constraints with non-negative coefficients
10 10 Eduardo Álvarez-Miranda et al. (b 1,..., b L ) and non-negative right-hand-side bounds (B 1,..., B L ). Let Ψ be a generic polyhedron containing the feasibility conditions for (x 1,..., x K, y 1,..., y L ). With these elements we define noal problem (P5) as OP T P 5 = (x 1,...,y L ) Ψ c 1 i i c K i xk i b 1 j y1 j B1,..., 1 K 1 L b L j yl j BL. (P5) We assume now that all elements of the cost vectors (c 1,..., c K ) and all elements of the knapsack coefficients (b 1,..., b L ) are subject to interval uncertainty; the cost coefficient of variable x k i is taken from [c k i, ck i + dk i ], for each i Ik and k K = {1,..., K}, and the coefficient of variable yj l is taken from [b l j, bl j + δl j ], for each j J l and l L = {1,..., L}. Assume that variables (x 1,..., y L ) are ordered so that d k i dk i+1 and dk I k +1 = 0, for all i Ik and k K, and δ l j δl j+1 and δl J l +1 = 0, for all j J l and l L. To each set of cost coefficients we associate a level of conservatism 0 Γ k X Ik, for all k K, and to each knapsack constraint we associate a level of conservatism 0 Γ l Y J l, for all l L. The following Theorem unifies the previous results. Theorem 1 For given 0 ΓX k Ik, for all k K, and 0 ΓY l J l, for all l L, the robust counterpart of (P5), ROP T P 5 (ΓX 1,..., Γ X K, Γ Y 1,..., Γ Y L ), can be computed by solving k K( I k ΓX k + 2) ( J l ΓY l + 2) l L problems given by ROP T P 5 (Γ 1 X,..., Γ K X, Γ 1 Y,..., Γ L Y ) = r 1 {Γ 1 X,..., I1 +1}. s L {Γ L Y,..., J L +1}. F (r1,...,r K,s 1,...,s L), where for r 1 {Γ 1 X,..., I1 +1},..., r K {Γ K X,..., IK +1} and s 1 {Γ 1 Y,..., J 1 +1},..., s L {Γ L Y,..., J L + 1}, we have that F (r1,...,r K,s 1,...,s L) =Γx 1 d r Γx K d r K + {ϕ 1 (r 1 ) ϕ K (r K ) (x 1,...,y K ) Ψ ξ 1 (s 1 ) B 1,..., ξ L (s L ) B L }, such that and ϕ l (r k ) = k c k i x k i + r k ( d k i d k r k ) x k i, k K, ξ l (s l ) = b l jy l ( j + δ l j δ l ) s y l l j, l L. l s l
11 A Note on the Bertsimas & Sim Algorithm for Robust Combinatorial Optimization Problems 11 Proof. The robust counterpart of (P5) can be written as ROP T P 5 (Γ 1 X,..., Γ K X, Γ 1 Y,..., Γ L Y ) = k K c k i x k i + ΓXθ k k + h k i (17) k k s.t. b l jyj l + ΓY l λ l + kj l B l, l L (18) l l h k i + θ k d k i x k i and θ k 0, i I k, k K (19) kj l + λ l δjy l j l and λ l 0, l J l, l L (20) h k i 0, i I k, k K (21) kj l 0, j J l, l L. (22) From Lemma 1 and 2, one can show by mathematical induction that any optimal solution for (17)- (22) satisfies θ k [0, d k ], for each k K, and λ l [0, δ l ], for each l L. Finally, mathematical ΓX k ΓY l induction is applied to the previously used decomposition approach to derive the result for computing ROP T P 5 (Γ 1 X,..., Γ L Y ). As stressed in the Introduction, several Combinatorial Optimization problems are particular cases of (P5), and if interval uncertainty in their parameters is brought into play, the algorithmic procedure described by Theorem 1 could be an alternative for solving their robust counterparts. Acknowledgements I. Ljubić is supported by the APART Fellowship of the Austrian Academy of Sciences. This support is greatly acknowledged. E. Álvarez-Miranda thanks the Institute of Advanced Studies of the Università di Bologna from where he is a PhD Fellow. References [Bertsimas and Sim(2003)] D. Bertsimas and M. Sim. Robust discrete optimization and network flows. Mathematical Programg, B(98):49 71, 2003.
Proximal mapping via network optimization
L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:
More informationA Robust Formulation of the Uncertain Set Covering Problem
A Robust Formulation of the Uncertain Set Covering Problem Dirk Degel Pascal Lutter Chair of Management, especially Operations Research Ruhr-University Bochum Universitaetsstrasse 150, 44801 Bochum, Germany
More informationA Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem
A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem John Karlof and Peter Hocking Mathematics and Statistics Department University of North Carolina Wilmington Wilmington,
More informationKey words. Mixed-integer programming, mixing sets, convex hull descriptions, lot-sizing.
MIXING SETS LINKED BY BI-DIRECTED PATHS MARCO DI SUMMA AND LAURENCE A. WOLSEY Abstract. Recently there has been considerable research on simple mixed-integer sets, called mixing sets, and closely related
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationRobust Geometric Programming is co-np hard
Robust Geometric Programming is co-np hard André Chassein and Marc Goerigk Fachbereich Mathematik, Technische Universität Kaiserslautern, Germany Abstract Geometric Programming is a useful tool with a
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationMinimizing the Number of Machines in a Unit-Time Scheduling Problem
Minimizing the Number of Machines in a Unit-Time Scheduling Problem Svetlana A. Kravchenko 1 United Institute of Informatics Problems, Surganova St. 6, 220012 Minsk, Belarus kravch@newman.bas-net.by Frank
More informationFairness in Routing and Load Balancing
Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria
More informationJUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationα α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More informationDuplicating and its Applications in Batch Scheduling
Duplicating and its Applications in Batch Scheduling Yuzhong Zhang 1 Chunsong Bai 1 Shouyang Wang 2 1 College of Operations Research and Management Sciences Qufu Normal University, Shandong 276826, China
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More informationHow To Find An Optimal Search Protocol For An Oblivious Cell
The Conference Call Search Problem in Wireless Networks Leah Epstein 1, and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. lea@math.haifa.ac.il 2 Department of Statistics,
More informationFacility Location: Discrete Models and Local Search Methods
Facility Location: Discrete Models and Local Search Methods Yury KOCHETOV Sobolev Institute of Mathematics, Novosibirsk, Russia Abstract. Discrete location theory is one of the most dynamic areas of operations
More informationSolutions to Homework 6
Solutions to Homework 6 Debasish Das EECS Department, Northwestern University ddas@northwestern.edu 1 Problem 5.24 We want to find light spanning trees with certain special properties. Given is one example
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationMinimally Infeasible Set Partitioning Problems with Balanced Constraints
Minimally Infeasible Set Partitioning Problems with alanced Constraints Michele Conforti, Marco Di Summa, Giacomo Zambelli January, 2005 Revised February, 2006 Abstract We study properties of systems of
More informationKey words. multi-objective optimization, approximate Pareto set, bi-objective shortest path
SMALL APPROXIMATE PARETO SETS FOR BI OBJECTIVE SHORTEST PATHS AND OTHER PROBLEMS ILIAS DIAKONIKOLAS AND MIHALIS YANNAKAKIS Abstract. We investigate the problem of computing a minimum set of solutions that
More informationHow To Solve The Line Connectivity Problem In Polynomatix
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER MARIKA NEUMANN MARC E. PFETSCH The Line Connectivity Problem Supported by the DFG Research
More informationNan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA
A Factor 1 2 Approximation Algorithm for Two-Stage Stochastic Matching Problems Nan Kong, Andrew J. Schaefer Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA Abstract We introduce
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationOn the k-path cover problem for cacti
On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationScheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
More informationCHAPTER 9. Integer Programming
CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral
More informationStern Sequences for a Family of Multidimensional Continued Fractions: TRIP-Stern Sequences
Stern Sequences for a Family of Multidimensional Continued Fractions: TRIP-Stern Sequences arxiv:1509.05239v1 [math.co] 17 Sep 2015 I. Amburg K. Dasaratha L. Flapan T. Garrity C. Lee C. Mihaila N. Neumann-Chun
More informationBatch Scheduling of Deteriorating Products
Decision Making in Manufacturing and Services Vol. 1 2007 No. 1 2 pp. 25 34 Batch Scheduling of Deteriorating Products Maksim S. Barketau, T.C. Edwin Cheng, Mikhail Y. Kovalyov, C.T. Daniel Ng Abstract.
More informationLECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method
LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right
More informationSteiner Tree Approximation via IRR. Randomized Rounding
Steiner Tree Approximation via Iterative Randomized Rounding Graduate Program in Logic, Algorithms and Computation μπλ Network Algorithms and Complexity June 18, 2013 Overview 1 Introduction Scope Related
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationThe Price of Robustness
The Price of Robustness Dimitris Bertsimas Melvyn Sim August 001; revised August, 00 Abstract A robust approach to solving linear optimization problems with uncertain data has been proposed in the early
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationA Robust Optimization Approach to Supply Chain Management
A Robust Optimization Approach to Supply Chain Management Dimitris Bertsimas and Aurélie Thiele Massachusetts Institute of Technology, Cambridge MA 0139, dbertsim@mit.edu, aurelie@mit.edu Abstract. We
More informationLinear Programming in Matrix Form
Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,
More informationApproximating Minimum Bounded Degree Spanning Trees to within One of Optimal
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal ABSTACT Mohit Singh Tepper School of Business Carnegie Mellon University Pittsburgh, PA USA mohits@andrew.cmu.edu In the MINIMUM
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More informationSolving polynomial least squares problems via semidefinite programming relaxations
Solving polynomial least squares problems via semidefinite programming relaxations Sunyoung Kim and Masakazu Kojima August 2007, revised in November, 2007 Abstract. A polynomial optimization problem whose
More informationInternational Doctoral School Algorithmic Decision Theory: MCDA and MOO
International Doctoral School Algorithmic Decision Theory: MCDA and MOO Lecture 2: Multiobjective Linear Programming Department of Engineering Science, The University of Auckland, New Zealand Laboratoire
More informationLecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one
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 information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three
More informationA Practical Scheme for Wireless Network Operation
A Practical Scheme for Wireless Network Operation Radhika Gowaikar, Amir F. Dana, Babak Hassibi, Michelle Effros June 21, 2004 Abstract In many problems in wireline networks, it is known that achieving
More informationImproved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem Marek Karpinski 1, Ion I. Măndoiu 2, Alexander Olshevsky 3, and Alexander Zelikovsky 4 1 Department of Computer Science,
More informationImproved Algorithms for Data Migration
Improved Algorithms for Data Migration Samir Khuller 1, Yoo-Ah Kim, and Azarakhsh Malekian 1 Department of Computer Science, University of Maryland, College Park, MD 20742. Research supported by NSF Award
More information1 The Line vs Point Test
6.875 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Low Degree Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz Having seen a probabilistic verifier for linearity
More informationRandomization Approaches for Network Revenue Management with Customer Choice Behavior
Randomization Approaches for Network Revenue Management with Customer Choice Behavior Sumit Kunnumkal Indian School of Business, Gachibowli, Hyderabad, 500032, India sumit kunnumkal@isb.edu March 9, 2011
More informationDynamic TCP Acknowledgement: Penalizing Long Delays
Dynamic TCP Acknowledgement: Penalizing Long Delays Karousatou Christina Network Algorithms June 8, 2010 Karousatou Christina (Network Algorithms) Dynamic TCP Acknowledgement June 8, 2010 1 / 63 Layout
More informationLogistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
More informationReducing Clocks in Timed Automata while Preserving Bisimulation
Reducing Clocks in Timed Automata while Preserving Bisimulation Shibashis Guha Chinmay Narayan S. Arun-Kumar Indian Institute of Technology Delhi {shibashis, chinmay, sak}@cse.iitd.ac.in arxiv:1404.6613v2
More informationDefinition 11.1. Given a graph G on n vertices, we define the following quantities:
Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define
More informationRecovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach
MASTER S THESIS Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach PAULINE ALDENVIK MIRJAM SCHIERSCHER Department of Mathematical
More informationCOMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationDiscrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using
More informationA Log-Robust Optimization Approach to Portfolio Management
A Log-Robust Optimization Approach to Portfolio Management Ban Kawas Aurélie Thiele December 2007, revised August 2008, December 2008 Abstract We present a robust optimization approach to portfolio management
More informationARTICLE IN PRESS. European Journal of Operational Research xxx (2004) xxx xxx. Discrete Optimization. Nan Kong, Andrew J.
A factor 1 European Journal of Operational Research xxx (00) xxx xxx Discrete Optimization approximation algorithm for two-stage stochastic matching problems Nan Kong, Andrew J. Schaefer * Department of
More informationOn the Multiple Unicast Network Coding Conjecture
On the Multiple Unicast Networ Coding Conjecture Michael Langberg Computer Science Division Open University of Israel Raanana 43107, Israel miel@openu.ac.il Muriel Médard Research Laboratory of Electronics
More informationSome Problems of Second-Order Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic
More informationON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS
ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS I. KIGURADZE AND N. PARTSVANIA A. Razmadze Mathematical Institute
More information8.1 Min Degree Spanning Tree
CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationCost Efficient Network Synthesis from Leased Lines
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany DIMITRIS ALEVRAS ROLAND WESSÄLY MARTIN GRÖTSCHEL Cost Efficient Network Synthesis from Leased Lines Preprint
More informationGLOBAL OPTIMIZATION METHOD FOR SOLVING MATHEMATICAL PROGRAMS WITH LINEAR COMPLEMENTARITY CONSTRAINTS. 1. Introduction
GLOBAL OPTIMIZATION METHOD FOR SOLVING MATHEMATICAL PROGRAMS WITH LINEAR COMPLEMENTARITY CONSTRAINTS N.V. THOAI, Y. YAMAMOTO, AND A. YOSHISE Abstract. We propose a method for finding a global optimal solution
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationWeighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs Leah Epstein Magnús M. Halldórsson Asaf Levin Hadas Shachnai Abstract Motivated by applications in batch scheduling of jobs in manufacturing
More informationScheduling Parallel Jobs with Monotone Speedup 1
Scheduling Parallel Jobs with Monotone Speedup 1 Alexander Grigoriev, Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands, {a.grigoriev@ke.unimaas.nl,
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationDiversity Coloring for Distributed Data Storage in Networks 1
Diversity Coloring for Distributed Data Storage in Networks 1 Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Pasadena, CA 9115, U.S.A. {jax, bruck}@paradise.caltech.edu Abstract
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationGenerating models of a matched formula with a polynomial delay
Generating models of a matched formula with a polynomial delay Petr Savicky Institute of Computer Science, Academy of Sciences of Czech Republic, Pod Vodárenskou Věží 2, 182 07 Praha 8, Czech Republic
More informationClassification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationNear Optimal Solutions
Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.
More informationAnalysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs
Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of
More informationTwo-Stage Stochastic Linear Programs
Two-Stage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 Two-Stage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic
More informationNote on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
More informationIntegrating Benders decomposition within Constraint Programming
Integrating Benders decomposition within Constraint Programming Hadrien Cambazard, Narendra Jussien email: {hcambaza,jussien}@emn.fr École des Mines de Nantes, LINA CNRS FRE 2729 4 rue Alfred Kastler BP
More informationarxiv:1203.1525v1 [math.co] 7 Mar 2012
Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined
More informationRN-Codings: New Insights and Some Applications
RN-Codings: New Insights and Some Applications Abstract During any composite computation there is a constant need for rounding intermediate results before they can participate in further processing. Recently
More informationMax-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationAn interval linear programming contractor
An interval linear programming contractor Introduction Milan Hladík Abstract. We consider linear programming with interval data. One of the most challenging problems in this topic is to determine or tight
More informationarxiv:math/0606467v2 [math.co] 5 Jul 2006
A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group arxiv:math/0606467v [math.co] 5 Jul 006 Richard P. Stanley Department of Mathematics, Massachusetts
More information11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
More informationThe Advantages and Disadvantages of Online Linear Optimization
LINEAR PROGRAMMING WITH ONLINE LEARNING TATSIANA LEVINA, YURI LEVIN, JEFF MCGILL, AND MIKHAIL NEDIAK SCHOOL OF BUSINESS, QUEEN S UNIVERSITY, 143 UNION ST., KINGSTON, ON, K7L 3N6, CANADA E-MAIL:{TLEVIN,YLEVIN,JMCGILL,MNEDIAK}@BUSINESS.QUEENSU.CA
More informationA NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES THEODORE A. SLAMAN AND ANDREA SORBI Abstract. We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: In fact, below
More informationDifferentiated Pricing of Urban Transportation Networks. Networks with Vehicle-Tracking Technologies
of Urban Transportation Networks with Vehicle-Tracking Technologies Mahmood Zangui Yafeng Yin* Siriphong Lawphongpanich Shigang Chen Department of Civil and Coastal Engineering University of Florida July
More information