Integer Programming and Combinatorial Optimization
16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings
Published on 20. February 2013
Book
Paperback/Softback
XII, 400 pages
978-3-642-36693-2 (ISBN)
Description
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.
More details
Series
Edition
2013 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
32 s/w Abbildungen
XII, 400 p. 32 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 23 mm
Weight
622 gr
ISBN-13
978-3-642-36693-2 (9783642366932)
DOI
10.1007/978-3-642-36694-9
Schweitzer Classification
Other editions
Additional editions
Michel Goemans | José Correa
Integer Programming and Combinatorial Optimization
16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings
E-Book
03/2013
Springer
€53.49
Available for download
Content
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.