Muutke küpsiste eelistusi

Integer Programming and Combinatorial Optimization: 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings 2013 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 400 pages, kõrgus x laius: 235x155 mm, kaal: 629 g, 32 Illustrations, black and white, 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 7801
  • Ilmumisaeg: 20-Feb-2013
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642366937
  • ISBN-13: 9783642366932
Teised raamatud teemal:
  • Pehme köide
  • Hind: 43,12 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,49 €
  • Säästad 25%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 3-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Integer Programming and Combinatorial Optimization: 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings 2013 ed.Suurem pilt
  • Formaat: Paperback / softback, 400 pages, kõrgus x laius: 235x155 mm, kaal: 629 g, 32 Illustrations, black and white, 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 7801
  • Ilmumisaeg: 20-Feb-2013
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642366937
  • ISBN-13: 9783642366932
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783642366932.html
Märksõnad:
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.