Integer Programming and Combinatorial Optimization : 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings / edited by Michel Goemans, José Correa.

Format:

Book

Contributor:

Goemans, Michel, editor.

Correa, José (Computer scientist), editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 7801.

Theoretical Computer Science and General Issues ; 7801

Language:

English

Subjects (All):

Numerical analysis.

Algorithms.

Computer science--Mathematics.

Computer science.

Numeric Computing.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Computer Science, general.

Local Subjects:

Numeric Computing.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Computer Science, general.

Physical Description:

1 online resource (XII, 400 pages) : 32 illustrations.

Edition:

First edition 2013.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.

System Details:

text file PDF

Summary:

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.

Contents:

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.

Other Format:

Printed edition:

ISBN:

978-3-642-36694-9

9783642366949

Access Restriction:

Restricted for use by site license.