Blick ins Buch

Integer Programming and Combinatorial Optimization

16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings

Michel Goemans, José Correa (Herausgeber)

Buch | Softcover

XII, 400 Seiten

2013 | 2013
Springer Berlin (Verlag)
978-3-642-36693-2 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)
Blick ins Buch (midvox)

Artikel merken

This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. 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 the Structure of Reduced Kernel Lattice Bases.- Constant Integrality Gap LP formulations of Unsplittable Flow on a Path.- Content Placement via the Exponential Potential Function Method.- Blocking Optimal Arborescences.- Matroid and Knapsack Center Problems.- On Some Generalizations of the Split Closure.- An Improved Integrality Gap for Asymmetric TSP Paths.- Two Dimensional Optimal Mechanism Design for a Sequencing Problem.- The Euclidean k-Supplier Problem.

Erscheint lt. Verlag	20.2.2013
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XII, 400 p. 32 illus.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	621 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Analysis
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Algorithm analysis and problem complexity • co-graphic matroids • knapsack problem • multistage robust optimization • quadratic programming • Scheduling
ISBN-10	3-642-36693-7 / 3642366937
ISBN-13	978-3-642-36693-2 / 9783642366932
Zustand	Neuware