50 Years of Integer Programming 1958-2008 from the Early Years to the State-Of-The-Art

Total Page：16

File Type：pdf, Size：1020Kb

50 Years of Integer Programming 1958-2008 from the Early Years to the State-Of-The-Art

M. Jünger, Th.M. Liebling, D. Naddef, G.L. Nemhauser, W.R. Pulleyblank, G. Reinelt, G. Rinaldi, L.A. Wolsey (Eds.) 50 Years of Integer Programming 1958-2008 From the Early Years to the State-of-the-Art ▶ Lectures of the pioneers of integer programming In 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory's seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session. 50 Years of Integer Programming offers an account of featured talks at the 2008 Aussois workshop, namely 2010, XX, 804 p. With DVD. - Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli: Polyhedral Approaches to Mixed Integer Linear Programming Printed book - William Cook: 50+ Years of Combinatorial Integer Programming Hardcover ▶ 119,99 € | £109.99 | $149.99 - Francois Vanderbeck and Laurence A. Wolsey: Reformulation and Decomposition of ▶ *128,39 € (D) | 131,99 € (A) | CHF 141.50 Integer Programs eBook The book contains reprints of key historical articles together with new introductions and historical perspectives by the authors: Egon Balas, Michel Balinski, Jack Edmonds, Ralph E. Available from your bookstore or Gomory, Arthur M. Geoffrion, Alan J. Hoffman & Joseph B. Kruskal, Richard M. Karp, Harold ▶ springer.com/shop W. Kuhn, and Ailsa H. Land & Alison G. Doig. MyCopy Printed eBook for just ▶ € | $ 24.99 ▶ springer.com/mycopy Order online at springer.com ▶ or for the Americas call (toll free) 1-800-SPRINGER ▶ or email us at: [email protected]. ▶ For outside the Americas call +49 (0) 6221-345-4301 ▶ or email us at: [email protected]. The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted..

Copy Link

Recommended publications

LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
LINEAR ALGEBRA METHODS IN COMBINATORICS LászlóBabai and PéterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c LászlóBabai and PéterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students.
[Show full text]
Curriculum Vitæ
Aleksandr M. Kazachkov May 30, 2021 Contact Department of Industrial and Systems Engineering Website akazachk.github.io Information Herbert Wertheim College of Engineering Email akazachkov@ufl.edu 303 Weil Hall, P.O. Box 116595 Office 401B Weil Hall Gainesville, FL 32611-6595, USA Phone +1.352.273.4902 Research Discrete optimization, including theoretical, methodological, and applied aspects, with an emphasis on devel- Interests oping better cutting plane techniques and open-source computational contributions Computational economics, particularly on the fair allocation of indivisible resources and fair mechanism design Social good applications, such as humanitarian logistics and donation distribution Academic University of Florida, Department of Industrial and Systems Engineering, Gainesville, FL, USA Positions Assistant Professor January 2021 – Present Courtesy Assistant Professor March 2020 – December 2020 Polytechnique Montréal, Department of Mathematics and Industrial Engineering, Montréal, QC, Canada Postdoctoral Researcher under Andrea Lodi May 2018 – December 2020 Education Carnegie Mellon University, Tepper School of Business, Pittsburgh, PA, USA Ph.D. in Algorithms, Combinatorics, and Optimization under Egon Balas May 2018 Dissertation: Non-Recursive Cut Generation M.S. in Algorithms, Combinatorics, and Optimization May 2013 Cornell University, College of Engineering, Ithaca, NY, USA B.S. in Operations Research and Engineering with Honors, Magna Cum Laude May 2011 Publications [1] P.I. Frazier and A.M. Kazachkov. “Guessing Preferences: A New Approach to Multi-Attribute Ranking and Selection”, Winter Simulation Conference, 2011. [2] J. Karp, A.M. Kazachkov, and A.D. Procaccia. “Envy-Free Division of Sellable Goods”, AAAI Conference on Artificial Intelligence, 2014. [3] J.P. Dickerson, A.M. Kazachkov, A.D. Procaccia, and T.
[Show full text]
Kombinatorische Optimierung – Blatt 1
Prof. Dr. Volker Kaibel M.Sc. Benjamin Peters Wintersemester 2016/2017 Kombinatorische Optimierung { Blatt 1 www.math.uni-magdeburg.de/institute/imo/teaching/wise16/kombopt/ Präsentation in der Ubung¨ am 20.10.2016 Aufgabe 1 Betrachte das Hamilton-Weg-Problem: Gegeben sei ein Digraph D = (V; A) sowie ver- schiedene Knoten s; t ∈ V . Ein Hamilton-Weg von s nach t ist ein s-t-Weg, der jeden Knoten in V genau einmal besucht. Das Problem besteht darin, zu entscheiden, ob ein Hamilton-Weg von s nach t existiert. Wir nehmen nun an, wir hätten einen polynomiellen Algorithmus zur Lösung des Kurzeste-¨ Wege Problems fur¨ beliebige Bogenlängen. Konstruiere damit einen polynomiellen Algo- rithmus fur¨ das Hamilton-Weg-Problem. Aufgabe 2 Der folgende Graph abstrahiert ein Straßennetz. Dabei geben die Kantengewichte die (von einander unabhängigen) Wahrscheinlichkeiten an, bei Benutzung der Straßen zu verunfallen. Bestimme den sichersten Weg von s nach t durch Aufstellen und Lösen eines geeignetes Kurzeste-Wege-Problems.¨ 2% 2 5% 5% 3% 4 1% 5 2% 3% 6 t 6% s 4% 2% 1% 2% 7 2% 1% 3 Aufgabe 3 Lesen Sie den Artikel The Year Combinatorics Blossomed\ (erschienen 2015 im Beijing " Intelligencer, Springer) von William Cook, Martin Grötschel und Alexander Schrijver. S. 1/7 {:::a äi, stq: (: W illianr Cook Lh t ivers it1' o-l' |'\'at ttlo t), dt1 t t Ll il Martin Grötschel ZtLse lnstitrttt; orttl'l-U Ilt:rlin, ()trrnnt1, Alexander Scfu ijver C\\/ I nul Ltn ivtrsi !)' o-l' Anrstt rtlan, |ietherlattds The Year Combinatorics Blossomed One summer in the mid 1980s, Jack Edmonds stopped Much has been written about linear programming, by the Research Institute for Discrete Mathematics including several hundred texts bearing the title.
[Show full text]
Matroid Partitioning Algorithm Described in the Paper Here with Ray’S Interest in Doing Ev- Erything Possible by Using Network flow Methods
Chapter 7 Matroid Partition Jack Edmonds Introduction by Jack Edmonds This article, “Matroid Partition”, which first appeared in the book edited by George Dantzig and Pete Veinott, is important to me for many reasons: First for per- sonal memories of my mentors, Alan J. Goldman, George Dantzig, and Al Tucker. Second, for memories of close friends, as well as mentors, Al Lehman, Ray Fulker- son, and Alan Hoffman. Third, for memories of Pete Veinott, who, many years after he invited and published the present paper, became a closest friend. And, finally, for memories of how my mixed-blessing obsession with good characterizations and good algorithms developed. Alan Goldman was my boss at the National Bureau of Standards in Washington, D.C., now the National Institutes of Science and Technology, in the suburbs. He meticulously vetted all of my math including this paper, and I would not have been a math researcher at all if he had not encouraged it when I was a university drop-out trying to support a baby and stay-at-home teenage wife. His mentor at Princeton, Al Tucker, through him of course, invited me with my child and wife to be one of the three junior participants in a 1963 Summer of Combinatorics at the Rand Corporation in California, across the road from Muscle Beach. The Bureau chiefs would not approve this so I quit my job at the Bureau so that I could attend. At the end of the summer Alan hired me back with a big raise. Dantzig was and still is the only historically towering person I have known.
[Show full text]
The Traveling Preacher Problem, Report No
Discrete Optimization 5 (2008) 290–292 www.elsevier.com/locate/disopt The travelling preacher, projection, and a lower bound for the stability number of a graph$ Kathie Camerona,∗, Jack Edmondsb a Wilfrid Laurier University, Waterloo, Ontario, Canada N2L 3C5 b EP Institute, Kitchener, Ontario, Canada N2M 2M6 Received 9 November 2005; accepted 27 August 2007 Available online 29 October 2007 In loving memory of George Dantzig Abstract The coflow min–max equality is given a travelling preacher interpretation, and is applied to give a lower bound on the maximum size of a set of vertices, no two of which are joined by an edge. c 2007 Elsevier B.V. All rights reserved. Keywords: Network flow; Circulation; Projection of a polyhedron; Gallai’s conjecture; Stable set; Total dual integrality; Travelling salesman cost allocation game 1. Coflow and the travelling preacher An interpretation and an application prompt us to recall, and hopefully promote, an older combinatorial min–max equality called the Coflow Theorem. Let G be a digraph. For each edge e of G, let de be a non-negative integer. The capacity d(C) of a dicircuit C means the sum of the de’s of the edges in C. An instance of the Coflow Theorem (1982) [2,3] says: Theorem 1. The maximum cardinality of a subset S of the vertices of G such that each dicircuit C of G contains at most d(C) members of S equals the minimum of the sum of the capacities of any subset H of dicircuits of G plus the number of vertices of G which are not in a dicircuit of H.
[Show full text]
What's the Matter with Tie-Breaking? Improving Efficiency in School Choice
American Economic Review 2008, 98:3, 669–689 http://www.aeaweb.org/articles.php?doi=10.1257/aer.98.3.669 What’s the Matter with Tie-Breaking? Improving Efficiency in School Choice By Aytek Erdil and Haluk Ergin* In several school choice districts in the United States, the student proposing deferred acceptance algorithm is applied after indifferences in priority orders are broken in some exogenous way. Although such a tie-breaking procedure preserves stability, it adversely affects the welfare of the students since it intro- duces artificial stability constraints. Our main finding is a polynomial-time algorithm for the computation of a student-optimal stable matching when pri- orities are weak. The idea behind our construction relies on a new notion which we call a stable improvement cycle. We also investigate the strategic properties of the student-optimal stable mechanism. (JEL C78, D82, I2) Until about a decade ago, children in the United States were assigned to public schools by the district they live in, without taking into account the preferences of their families. Such systems overlooked reallocations of seats which could Pareto improve welfare. Motivated by such con- cerns, several US cities, including New York City, Boston, Cambridge, Charlotte, Columbus, Denver, Minneapolis, Seattle, and St. Petersburg-Tampa, started centralized school choice pro- grams. Typically in these programs, each family submits a preference list of schools, including those outside their district, and then a centralized mechanism assigns students to schools based on the preferences. The mechanisms initially adopted by school choice programs were ad hoc, and did not perform well in terms of efficiency, incentives, and/or stability.
[Show full text]
Submodular Functions, Optimization, and Applications to Machine Learning — Spring Quarter, Lecture 11 —
Submodular Functions, Optimization, and Applications to Machine Learning | Spring Quarter, Lecture 11 | http://www.ee.washington.edu/people/faculty/bilmes/classes/ee596b_spring_2016/ Prof. Jeff Bilmes University of Washington, Seattle Department of Electrical Engineering http://melodi.ee.washington.edu/~bilmes May 9th, 2016 f (A) + f (B) f (A B) + f (A B) Clockwise from top left:v Lásló Lovász Jack Edmonds ∪ ∩ Satoru Fujishige George Nemhauser ≥ Laurence Wolsey = f (A ) + 2f (C) + f (B ) = f (A ) +f (C) + f (B ) = f (A B) András Frank r r r r Lloyd Shapley ∩ H. Narayanan Robert Bixby William Cunningham William Tutte Richard Rado Alexander Schrijver Garrett Birkho Hassler Whitney Richard Dedekind Prof. Jeff Bilmes EE596b/Spring 2016/Submodularity - Lecture 11 - May 9th, 2016 F1/59 (pg.1/60) Logistics Review Cumulative Outstanding Reading Read chapters 2 and 3 from Fujishige's book. Read chapter 1 from Fujishige's book. Prof. Jeff Bilmes EE596b/Spring 2016/Submodularity - Lecture 11 - May 9th, 2016 F2/59 (pg.2/60) Logistics Review Announcements, Assignments, and Reminders Homework 4, soon available at our assignment dropbox (https://canvas.uw.edu/courses/1039754/assignments) Homework 3, available at our assignment dropbox (https://canvas.uw.edu/courses/1039754/assignments), due (electronically) Monday (5/2) at 11:55pm. Homework 2, available at our assignment dropbox (https://canvas.uw.edu/courses/1039754/assignments), due (electronically) Monday (4/18) at 11:55pm. Homework 1, available at our assignment dropbox (https://canvas.uw.edu/courses/1039754/assignments), due (electronically) Friday (4/8) at 11:55pm. Weekly Office Hours: Mondays, 3:30-4:30, or by skype or google hangout (set up meeting via our our discussion board (https: //canvas.uw.edu/courses/1039754/discussion_topics)).
[Show full text]
2019 Contents 2019
mathematical sciences news 2019 contents 2019 Editor-in-Chief Tom Bohman Contributing Writers Letter from Department 03 Tom Bohman Head, Tom Bohman Jocelyn Duffy Bruce Gerson Florian Frick 04 Ben Panko Emily Payne Faculty Notes Ann Lyon Ritchie Franziska Weber Graphic Design and Photography 10 Carnegie Mellon University Expanding the Boundaries on Marketing & Communications Summer Undergraduate Research Mellon College of Science Communications 14 Carnegie Mellon University Frick's Fellowship Department of Mathematical Sciences Wean Hall 6113 Pittsburgh, PA 15213 20 cmu.edu/math In Memorium Carnegie Mellon University does not discriminate in admission, employment, or administration of its programs or activities on the basis of race, color, national origin, sex, 24 handicap or disability, age, sexual orientation, gender identity, religion, creed, ancestry, belief, veteran status, or genetic information. Furthermore, Carnegie Mellon University does Alumni News not discriminate and is required not to discriminate in violation of federal, state, or local laws or executive orders. Inquiries concerning the application of and compliance with this statement should be directed to the university ombudsman, Carnegie Mellon University, 5000 Forbes 26 Avenue, Pittsburgh, PA 15213, telephone 412-268-1018. Obtain general information about Carnegie Mellon University Student News by calling 412-268-2000. Produced for the Department of Mathematical Sciences by Marketing & Communications, November, 2019, 20-137. ©2019 Carnegie Mellon University, All rights reserved. No 30 part of this publication may be reproduced in any form without written permission from Carnegie Mellon University's Department of Mathematical Sciences. Class of 2019 1 Letter from Mathematics Department Head, Tom Bohman Undergraduate research has become a hallmark of a Carnegie Mellon University education, with students citing that it has helped to prepare them for their futures in academia and the workforce.
[Show full text]
Ecole Polytechnique Departement D'economie
ECOLE POLYTECHNIQUE CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE Judge : Don't Vote! Michel BALINSKI Rida LARAKI Novembre 2010 Cahier n° 2010-27 DEPARTEMENT D'ECONOMIE Route de Saclay 91128 PALAISEAU CEDEX (33) 1 69333033 http://www.economie.polytechnique.edu/ / mailto:[email protected] Judge : Don't Vote! 1 Michel Balinski 2 Rida Laraki Novembre 2010 Cahier n° 2010-27 Résumé: Cet article explique pourquoi (1) le modèle traditionnel de choix social n’est pas réaliste, (2) il ne peut en aucun cas proposer une méthode acceptable pour classer et élire, et (3) qu’un modèle plus réaliste implique inévitablement une seule méthode pour classer et élire ---le jugement majoritaire--- qui satisfait le mieux qu’il se peut les critères traditionnels de ce qui constitue une bonne méthode. Abstract: This article explains why (1) the traditional model of the theory of social choice misrepresents reality, (2) it cannot lead to acceptable methods of ranking and electing in any case, and (3) a more realistic model leads inevitably to one method of ranking and electing---majority judgment---that best meets the traditional criteria of what constitutes a good method. Mots clés : Paradoxe d’Arrow, paradoxe de Condorcet, patinage artistique, choix social, jugement majoritaire, manipulation stratégique, vote Key Words : Arrow’s paradox, Condorcet’s paradox, majority judgment, skating, social choice, strategic manipulation, voting Classification JEL: D71, C72 Classification AMS: 91A, 91C, 90B 1 Economics Department of the Ecole Polytechnique and CNRS, France. 2 Economics Department of the Ecole Polytechnique and CNRS, France. Judge : Don’t Vote! Michel Balinski and Rida Laraki The ﬁnal test of a theory is its capacity to solve the problems which originated it.
[Show full text]
Basic Polyhedral Theory 3
BASIC POLYHEDRAL THEORY VOLKER KAIBEL A polyhedron is the intersection of finitely many affine halfspaces, where an affine halfspace is a set ≤ n H (a, β)= x Ê : a, x β { ∈ ≤ } n n n Ê Ê for some a Ê and β (here, a, x = j=1 ajxj denotes the standard scalar product on ). Thus, every∈ polyhedron is∈ the set ≤ n P (A, b)= x Ê : Ax b { ∈ ≤ } m×n of feasible solutions to a system Ax b of linear inequalities for some matrix A Ê and some m ≤ n ′ ′ ∈ Ê vector b Ê . Clearly, all sets x : Ax b, A x = b are polyhedra as well, as the system A′x = b∈′ of linear equations is equivalent{ ∈ the system≤ A′x }b′, A′x b′ of linear inequalities. A bounded polyhedron is called a polytope (where bounded≤ means− that≤ there − is a bound which no coordinate of any point in the polyhedron exceeds in absolute value). Polyhedra are of great importance for Operations Research, because they are not only the sets of feasible solutions to Linear Programs (LP), for which we have beautiful duality results and both practically and theoretically efficient algorithms, but even the solution of (Mixed) Integer Linear Pro- gramming (MILP) problems can be reduced to linear optimization problems over polyhedra. This relationship to a large extent forms the backbone of the extremely successful story of (Mixed) Integer Linear Programming and Combinatorial Optimization over the last few decades. In Section 1, we review those parts of the general theory of polyhedra that are most important with respect to optimization questions, while in Section 2 we treat concepts that are particularly relevant for Integer Programming.
[Show full text]
Download File
Experimental Democracy – Collective Intelligence for a Diverse and Complex World Felix Gerlsbeck Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA UNIVERSITY 2013 © 2013 Felix Gerlsbeck All rights reserved Abstract Experimental Democracy – Collective Intelligence for a Diverse and Complex World Felix Gerlsbeck My dissertation is motivated by the following observation: while we care very much about the outcomes of the democratic process, there is widespread uncertainty about ex ante how to produce them—and quite often there is also disagreement and uncertainty about what they are in the first place. Consequently, unless we have a definite idea what “better decision-making” might be, it is not obvious which institutional reforms or changes in democratic structures would actually promote it. Democracy is a wide concept, and not all institutional constellations and rules and regulations that can be called democratic function equally well. In this dissertation therefore I offer a specific model of democracy— “Experimental Democracy”—that unites the view that the quality of decisions matter, with taking into account the circumstances of uncertainty and disagreement that define political problems. On this account, a desirable political mechanism is one that realizes an experimental method of policy-making directed at solving problems, such that we can expect it to make progress over time, even though we cannot rule out that it will get things wrong—possibly even frequently. I also show how democracy may best realize such an experimental method, and which particular institutional features of democracy could serve this purpose.
[Show full text]
On the Depth of Cutting Planes
On the depth of cutting planes Laurent Poirrier, James Yu∗ flpoirrier,[email protected] March 12, 2019 Abstract We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical strength of cutting planes. In particular, we show that its value lies in a well-defined interval, and we give parametric upper bounds on the depth of two prominent types of cutting planes: split cuts and intersection cuts from a simplex tableau. Interestingly, these parametric bounds can help explain behaviors that have been observed computationally. For polyhedra, the depth of an individual cutting plane can be computed in polynomial time through an LP formulation, and we show that it can be computed in closed form in the case of corner polyhedra. 1 Introduction Cutting planes (also called valid inequalities or cuts) have proven computationally useful since the very early history of Integer Programming (IP). In the pioneering work of Dantzig, Fulkerson and Johnson [10] on the traveling salesman problem, cutting planes were the main computational tool alongside the simplex method. They were initially less successful for general IP problems, where they were largely outperformed by Land and Doig's branch-and-bound method [23]. However, in the mid-nineties, Balas, Ceria and Cornuéjols[2] proposed combining the two: first adding a few rounds of cuts, before resorting to branch-and-bound. Since then, cutting planes have become a central component of IP solvers [3], the most effective single families of cuts being Gomory's Mixed-Integer (GMI) cuts [19], and Nemhauser and Wolsey's Mixed-Integer Rounding (MIR) cuts [24, 25].
[Show full text]