Integer programming and combinatorial optimization : 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings /: 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. (2016)

• Record Type: Book
• Other Titles: IPCO 2016
• Further Information: Note: Quentin Louveaux, Martin Skutella (eds.).
• Editors: Louveaux, Quentin; (Mathematician), Skutella, Martin
• Other Names: Conference on Integer Programming and Combinatorial Optimization, 18th
• Contents: Intro; Preface; Organization; Contents; On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming; 1 Introduction; 2 Proof of Theorem1; 2.1 Approximation in the Inner Region; 2.2 Decomposition of the Outer Region; References; Centerpoints: A Link Between Optimization and Convex Geometry; 1 Introduction; 2 An Application to Mixed-Integer Optimization; 3 General Properties; 4 Specialized Properties; 5 Computational Aspects; 5.1 Exact Algorithms; 5.2 Approximation Algorithms; References; Rescaled Coordinate Descent Methods for Linear Programming; 1 Introduction; 2 Algorithm 1 3 Algorithm 2: A Dual Chubanov Algorithm3.1 Refinements; References; Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems; 1 Introduction; 2 An LP-Relaxation for MCCST and Preliminaries; 3 An LP-Rounding Approximation Algorithm; 3.1 An Overview; 3.2 Algorithm Details and Analysis; 4 A Reduction from Weighted to Unweighted Problems; 5 Towards a -Approximation Algorithm for (QP); References; Max-Cut Under Graph Constraints; 1 Introduction; 1.1 Our Results and Techniques; 1.2 Related Work; 2 Preliminaries; 3 Approximation Algorithm for GCMC 3.1 Linear Program3.2 The Rounding Algorithm; 3.3 Algorithm Analysis; References; Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem; 1 Introduction; 2 Preliminaries; 2.1 The Chinese Postman Problem and Minimum T-joins; 3 Sparsest Cut in Planar Graphs; 4 Graphs with no K5 Minor; 5 Maximum Concurrent Flow; 5.1 Planar Graphs; 5.2 Graphs with no K5 Minor; References; Intersection Cuts for Bilevel Optimization; 1 Introduction; 2 Literature Overview; 3 Bilevel-Free Sets; 4 Mixed-Integer Bilevel Linear Programming; 5 A New Family of Cuts for MIBLP 6 Informed No-Good Cuts7 Preliminary Computational Results; References; Exact Algorithms for the Chance-Constrained Vehicle Routing Problem; 1 Introduction; 2 Problem Definition and an Edge-Based Formulation; 2.1 Edge-Based Formulation; 2.2 Vehicle Requirements in the Capacity Inequalities; 2.3 Joint Normal Random Demands; 3 Dantzig-Wolfe Formulation; 3.1 Relaxed Pricing; 3.2 Relaxed Pricing for Joint Normal Demands; 4 Computational Experiments; 4.1 Comparison of the CCVRP with Recourse Models; 5 Conclusion; References; Extended Formulations in Mixed-Integer Convex Programming; 1 Introduction 2 Extended Formulations and Conic Representability3 An Outer-Approximation Algorithm for Mixed-Integer Conic Programming; 4 Extended Formulations and Disciplined Convex Programming; 5 Computational Results; References; k-Trails: Recognition, Complexity, and Approximations; 1 Introduction; 1.1 Our Results; 2 Recognition of k-Trails; 3 Containment of Minimum Weight k-Trails; References; Better s-t-Tours by Gao Trees; 1 Introduction; 1.1 Previous Work; 1.2 Notation and Preliminaries; 1.3 Best-of-Many Christofides; 1.4 Gao Trees; 1.5 Our Contribution; 2 Proof of the Structure Theorem
• Publisher Details: Switzerland : Springer
• Publication Date: 2016
• Extent: 1 online resource (xiii, 412 pages), illustrations
• Subjects: 519.7/7; Computer science; Integer programming -- Congresses; Combinatorial optimization -- Congresses; Combinatorial optimization; Integer programming; Computers -- Programming -- Algorithms; Computers -- Data Processing; Computers -- Hardware -- Network Hardware; Algorithms & data structures; Discrete mathematics; Network hardware; Electronic data processing; Computer software; Computational complexity; Computer Communication Networks; Mathematical theory of computation; Electronic books; Conference papers and proceedings; Electronic books
• Languages: English
• ISBNs: 9783319334615; 3319334611
• Related ISBNs: 9783319334608; 3319334603
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed June 6, 2016).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.