Integer Programming and Combinatorial Optimization - Info and Reading Options

Open Data:

Intro -- Preface -- Conference Organization -- Contents -- Improving the Approximation Ratio for Capacitated Vehicle Routing -- 1 Introduction -- 1.1 Formal Problem Description -- 1.2 Outline -- 1.3 Related Work -- 1.4 Review of the Classical Algorithms -- 2 Difficult Instances -- 3 Vehicle Routing with Target Groups -- 4 Clustering Algorithm -- 5 Weak Fractional Solutions -- 6 Solving Vehicle Routing with Target Groups -- References -- Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual -- 1 Introduction -- 1.1 Related Work and Known Results -- 1.2 Our Contribution -- 2 Preliminaries -- 3 LP Formulations -- 3.1 Dual Transformation -- 4 The k-Taxi Problem on HSTs -- 4.1 Constructing the Dual Solution -- 4.2 Finalizing the Analysis for k-Taxi on HSTs -- 5 The k-Taxi Problem on Weighted Trees -- References -- Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth -- 1 Introduction -- 2 Results and Outline -- 3 The Vertex Cover LP -- 4 Rounding Fractional Vertex Covers in d-Partite Hypergraphs -- 5 Inapproximability -- 6 Reducing Vertex Deletion to Constant Depth -- References -- Sum-of-Squares Hierarchies for Binary Polynomial Optimization -- 1 Introduction -- 1.1 The Sum-of-Squares Hierarchy on the Boolean Cube -- 1.2 A Second Hierarchy of Bounds -- 1.3 Asymptotic Analysis for Both Hierarchies -- 1.4 Related Work -- 1.5 Overview of the Proof -- 2 Sketch of Proof -- 2.1 The Polynomial Kernel Technique -- 2.2 Fourier Analysis on Bn and the Funk-Hecke Formula -- 2.3 Optimizing the Choice of the Univariate Polynomial u -- 2.4 The Inner Lasserre Hierarchy and Orthogonal Polynomials -- 3 Concluding Remarks -- References -- Complexity, Exactness, and Rationality in Polynomial Optimization -- 1 Introduction -- 2 Existence of Rational Feasible Solutions -- 3 NP-Hardness of Determining Existence of Rational Feasible Solutions

Search for “Integer Programming and Combinatorial Optimization” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Integer Programming and Combinatorial Optimization” in Libraries Near You:

Read or borrow “Integer Programming and Combinatorial Optimization” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Integer Programming and Combinatorial Optimization” at a library near you.