Andrea Lodi Livres

This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.

The book explores various advanced topics in computational sustainability and optimization. It begins with a discussion on a MIP-Cut metascheme and addresses challenges in CPAIOR. Key contributions include lazy clause generation that merges SAT, CP, and potentially MIP solving, and insights on matrices, automata, and double counting. The text also delves into the increasing Nvalue constraint and enhancements to the Held and Karp approach via constraint programming. Further, it characterizes and automates matching-based neighborhoods and presents rapid learning techniques for binary programs. Hybrid methods are proposed for sequencing problems in multileaf collimators, while the exploitation of subproblem equivalence in constraint programming is examined. The application of logic-based Benders decomposition for scheduling over long time horizons is discussed alongside integrated maintenance scheduling for semiconductor manufacturing. Additional topics cover service consolidation through constraint programming, wildlife conservation connected subgraph problems, and revisiting the bin packing constraint. The framework for Gomory’s mixed-integer cuts and disjunctive optimization is introduced, alongside a SAT encoding for multi-dimensional packing issues. Job shop scheduling is tackled with setup times, and vehicle routing for food rescue programs is compared across different methodologies. The book also highlights automated co

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.