Integer Programming and Combinatorial Optimization : 18th International Conference, IPCO 2016, Liege, Belgium, June 1-3, 2016, Proceedings - neues Buch

Buch in der Datenbank seit 2017-04-17T04:26:24+02:00 (Zurich)
Detailseite zuletzt geändert am 2022-05-09T19:42:47+02:00 (Zurich)
ISBN/EAN: 9783319334615

ISBN - alternative Schreibweisen:
978-3-319-33461-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: martin
Titel des Buches: combinatorial optimization, integer programming

Daten vom Verlag:

Autor/in: Quentin Louveaux; Martin Skutella
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings
Verlag: Springer; Springer International Publishing
412 Seiten
Erscheinungsjahr: 2016-05-25
Cham; CH
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIII, 412 p. 33 illus.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Numerische Mathematik; Verstehen; Approximation algorithms; Combinatorial optimization; Computational complexity; Integer programming; Linear programming; Computational geometry; Cutting planes; Diophantine equations; Geometry of numbers; Graphs and networks; Knapsack problem; Matroids; NP-completeness; Online algorithms; Polyhedral combinatorics; Polynomial algorithm; Randomized algorithms; Scheduling; Semidefinite programs; Submodular functions; C; Numerical Analysis; Algorithms; Discrete Mathematics in Computer Science; Computer Communication Networks; Computer Science; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Netzwerk-Hardware; BC

This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

On Approximation Algorithms for Concave Mixed-Integer QuadraticProgramming.- Centerpoints: A link between optimization and convex geometry.- Rescaled coordinate descent methods for Linear Programming.- Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.- Max-Cut under Graph Constraints.- Sparsest cut in planar graphs, maximum concurrent ows and their connections with the max-cut problem.- Intersection Cuts for Bilevel Optimization.- Exact Algorithms for the Chance-Constrained Vehicle Routing Problem.- Extended Formulations in Mixed-integer Convex Programming.- k-Trails: Recognition, Complexity, and Approximations.- Better s-t-Tours by Gao Trees.- Popular Edges and Dominant Matchings.- Semidefinite and linear programming integrality gaps for scheduling identical machines.- Stabilizing network bargaining games by blocking players.- Round Robin Tournaments Generated by the Circle Method have Maximum Carry-Over.- Extreme Functions with an Arbitrary Number of Slopes.- Minimal cut-generating functions are nearly extreme.- On the Mixed Binary Representability of Ellipsoidal Regions.- Constant Factor Approximation for ATSP with Two Edge Weights.- Improved Approximation Algorithms for Hitting 3-Vertex Paths.- Improved Approximations for Cubic Bipartite and Cubic TSP.- An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ϵ capacity violation.- Valid Inequalities for Separable Concave Constraints with Indicator Variables.- A Polyhedral Approach to Online Bipartite Matching.- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank.- Robust Monotone Submodular Function Maximization.- Maximizing Monotone Submodular Functions over the Integer Lattice.- Submodular Unsplittable Flow on Trees.- Strong reductions for extended formulations.- Sum-of-squares lower bounds for maximally symmetric formulations.- Sum-of-squares lower bounds for maximally symmetric formulations.- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.- On the quantile cut closure of chance-constrained problems.