Integer Programming and Combinatorial Optimization -

Integer Programming and Combinatorial Optimization

20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings
Buch | Softcover
XI, 454 Seiten
2019 | 1st ed. 2019
Springer International Publishing (Verlag)
978-3-030-17952-6 (ISBN)
79,17 inkl. MwSt

This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019.

The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 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.

Identically Self-Blocking Clutters.- Min-Max Correlation Clustering via .- Strong Mixed-Integer Programming Formulations for Trained Neural.- Extended Formulations from Communication Protocols in Output-Efficient.- Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry.- Intersection Cuts for Polynomial Optimization.-  Fixed-Order Scheduling on Parallel Machines.-  Online Submodular Maximization: Beating 1/2 Made Simple.- Improving the Integrality Gap for Multiway Cut.- nell 1-sparsity Approximation Bounds for Packing Integer Programs.-  A General Framework for Handling Commitment in Online Throughput Maximization.- Lower Bounds and A New Exact Approach for the Bilevel Knapsack with Interdiction Constraints.-  On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.- Tight Approximation Ratio for Minimum Maximal Matching.-  Integer Programming and Incidence Treedepth.-  A Bundle Approach for SDPs with Exact Subgraph Constraints.-  Dynamic Flows with Adaptive Route Choice.-  The Markovian Price of Information.- On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem.- On Compact Representations of Voronoi Cells of Lattices.- An Efficient Characterization of Submodular Spanning Tree Games.- The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio.- Approximate Multi-Matroid Intersection via Iterative Refinement.-  An Exact Algorithm for Robust Influence Maximization.- A New Contraction Technique with Applications to Congruency-Constrained Cuts.- Sparsity of Integer Solutions in the Average Case.- A Generic Exact Solver for Vehicle Routing and Related Problems.- Earliest Arrival Transshipments in Networks With Multiple Sinks.-  Intersection Cuts for Factorable MINLP.- Linear Programming Using Limited-Precision Oracles.- Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time.- Breaking Symmetries toRescue SoS: The Case of Makespan Scheduling.- Random Projections for Quadratic Programs over a Euclidean Ball.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XI, 454 p. 313 illus., 20 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 712 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algorithm analysis and problem complexity • Applications • approximation algorithms • Approximation Theory • Artificial Intelligence • combinatorial optimization • computational results • Computer Networks • Computer Science • conference proceedings • data structures • Game Theory • graph theory • Heuristic Methods • Informatics • Integer Programming • Internet • Linear Programming • Problem Solving • Research • scheduling algorithms • Software engineering
ISBN-10 3-030-17952-4 / 3030179524
ISBN-13 978-3-030-17952-6 / 9783030179526
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Wie bewerten Sie den Artikel?
Bitte geben Sie Ihre Bewertung ein:
Bitte geben Sie Daten ein:
Mehr entdecken
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
37,99
Grundlagen und formale Methoden

von Uwe Kastens; Hans Kleine Büning

Buch | Hardcover (2021)
Hanser, Carl (Verlag)
29,99