Cantitate/Preț
Produs

Integer Programming and Combinatorial Optimization

Editat de Michel Goemans, José Correa
en Limba Engleză Paperback – 20 feb 2013
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.
Citește tot Restrânge

Preț: 38293 lei

Puncte Express: 574

Preț estimativ în valută:
6766 7799$ 5907£

Carte tipărită la comandă

Livrare economică 16-30 mai


Specificații

ISBN-13: 9783642366932
ISBN-10: 3642366937
Pagini: 412
Ilustrații: XII, 400 p. 32 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:2013
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.

Caracteristici

Up to date results Fast track conference proceedings State of the art research