Giovanni Rinaldi

Andrea Lodi

Alessandro Panconesi

This book constitutes the refereed proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, held in Bertinoro, Italy, in May 2008. The 32 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers cover various aspects of integer programming and combinatorial optimization and present recent developments in theory, computation, and applications in that area. Topics included are such as approximation algorithms, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, and semidefinite programs.

13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings

Integer Programming and Combinatorial Optimization

Michael Jünger

Gerhard Reinelt

This book is dedicated to Jack Edmonds in appreciation of his ground breaking work that laid the foundations for a broad variety of subsequent results achieved in combinatorial optimization.The main part consists of 13 revised full papers on current topics in combinatorial optimization, presented at Aussois 2001, the Fifth Aussois Workshop on Combinatorial Optimization, March 5-9, 2001, and dedicated to Jack Edmonds.Additional highlights in this book are an account of an Aussois 2001 special session dedicated to Jack Edmonds including a speech given by William R. Pulleyblank as well as newly typeset versions of three up-to-now hardly accessible classical papers:- Submodular Functions, Matroids, and Certain Polyhedranbsp;nbsp; by Jack Edmonds- Matching: A Well-Solved Class of Integer Linear Programsnbsp;nbsp; by Jack Edmonds and Ellis L. Johnson- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problemsnbsp;nbsp; by Jack Edmonds and Richard M. Karp.

Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers

Combinatorial Optimization -- Eureka, You Shrink!

Laurence A. Wolsey

George L. Nemhauser

William R. Pulleyblank

Thomas M. Liebling

Denis Naddef

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience.

From the Early Years to the State-of-the-Art

50 Years of Integer Programming 1958-2008

The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The ?rst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995 [LNCS 920], Vancouver (Canada) 1996 [LNCS 1084], Houston (USA) 1998 [LNCS 1412], Graz (Austria) 1999 [LNCS 1610], Utrecht (The Netherlands) 2001 [LNCS 2081], Boston (USA) 2002 [LNCS 2337], New York (USA) 2004 [LNCS 2986], Berlin (Germany) 2005 [LNCS 3509], and Ithaca (USA) 2007 [LNCS 4168]. The c- ference is not held in the years when the International Symposium of the Ma- ematical Programming Society takes place.

Jon Lee

A. Ridha Mahjoub

This book constitutes the thoroughly refereed post-conference proceedings of the 5th International Symposium on Combinatorial Optimization, ISCO 2017, held in Marrakesh, Marocco, in April 2018. The 35 revised full papers presented in this book were carefully reviewed and selected from 75 submissions. The symposium aims to bring together researchers from all the communities related to combinatorial optimization, including algorithms and complexity, mathematical programming and operations research.

5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers

Combinatorial Optimization

Giovanni Rinaldi

About

Books

Join the club