DOCSLIB.ORG

Laurence Wolsey - Wikipedia

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Laurence Wolsey - Wikipedia 19/1/2018 Laurence Wolsey - Wikipedia Laurence Wolsey Laurence Alexander Wolsey is an English mathematician working in the field of integer programming. He is a former president and research director of the Center for Operations Research and Econometrics (CORE) at Université catholique de Louvain in Belgium.[1] He is professor emeritus of applied mathematics at the engineering school of the same university. Contents Early life and education Career Research Awards and honours Selected publications References External links Early life and education Wolsey received a MSc in Mathematics from Cambridge in 1966 and a Ph.D. in Mathematics from the Massachusetts Institute of Technology in 1969 under the supervision of Jeremy F. Shapiro.[2] Career Wolsey was visiting researcher at the Manchester Business School in 1969–1971. He was invited by George L. Nemhauser as a Post-Doctoral student to CORE in Belgium in 1971. He met his future wife, Marguerite Loute, sister of CORE colleague Etienne Loute, and settled in Belgium. He was later a visiting professor at the London School of Economics in 1978–1979, at Cornell University in 1983, at Ecole polytechnique de Lausanne in 1986–1987, and Donders professor at University of Utrecht in 1998. Wolsey was the editor-in-chief of the Mathematical Programming journal from 1999 to 2003. Research Wolsey has made seminal contributions in duality theory for integer programming, submodular optimization, the group-theoretic approach and polyhedral analysis of fixed-charge network flow and production planning models.[3] Awards and honours Wolsey has received the Beale-Orchard Hays Prize in 1988,[4][5] the Frederick W. Lanchester Prize in 1989,[6] the EURO Gold Medal in 1994, the John von Neumann Theory Prize in 2012, and the Dantzig Prize in 2012.[7][8] The ORBEL Wolsey award is a Belgian prize recognizing the best and most significant OR implementation contributed to Open-Source during the year. https://en.wikipedia.org/wiki/Laurence_Wolsey 1/2 19/1/2018 Laurence Wolsey - Wikipedia Selected publications Integer and Combinatorial Optimization (with George L. Nemhauser, Wiley, 1988) Integer Programming (Wiley, 1998) Production Planning by Mixed Integer Programming (with Yves Pochet, Springer, 2006) Wolsey, Laurence A. (1981). "Integer programming duality: Price functions and sensitivity analysis". Mathematical Programming A. 20: 173–195. doi:10.1007/BF01589344 (https://doi.org/10.1007%2FBF01589344). Nemhauser, G. L.; L. A. Wolsey; M. L. Fisher (1978). "An analysis of approximations for maximizing submodular set functions I". Mathematical Programming A. 14: 265–294. doi:10.1007/BF01588971 (https://doi.org/10.1007%2 FBF01588971). Wolsey, Laurence A. (1971). "Extensions of the Group Theoretic Approach in Integer Programming". Management Science. 18: 1 74–183. doi:10.1287/mnsc.18.1.74 (https://doi.org/10.1287%2Fmnsc.18.1.74). Van Roy, T. J.; Laurence A. Wolsey (1987). "Solving mixed integer programming problems using automatic reformulation". Operations Research. 35: 45–57. doi:10.1287/opre.35.1.45 (https://doi.org/10.1287%2Fopre.35.1. 45). Yves Pochet; Laurence A. Wolsey (2006). Production Planning by Mixed Integer Programming. Springer. ISBN 978-1441921321. References 1. Yurii Nesterov (2004). Introductory Lectures on Convex Optimization: A Basic Course (https://books.google.com/b ooks?id=VyYLem-l3CgC&pg=PR14). Springer Science & Business Media. pp. 14–. ISBN 978-1-4020-7553-7. 2. Laurence Wolsey (https://www.genealogy.math.ndsu.nodak.edu/id.php?id=67786) at the Mathematics Genealogy Project 3. Denis Bouyssou; Silvano Martello; Frank Plastria (2007). Surveys in Operations Research (invited Surveys from 40R) (https://books.google.com/books?id=df4YAQAAIAAJ). Springer. 4. "Beale-Orchard-Hays Prize past winners" (http://www.mathopt.org/?nav=boh#winners). Retrieved 26 March 2013. 5. "Prizes and Awards" (http://www.mathopt.org/Old-Optima-Issues/optima25.pdf) (PDF). Optima. November 1988. Retrieved 17 April 2013. 6. "Frederick W. Lanchester 1989 Prize citation" (https://web.archive.org/web/20130202114321/http://www.informs.o rg/Recognize-Excellence/Award-Recipients/Laurence-A.-Wolsey). INFORMS. Archived from the original (https://w ww.informs.org/Recognize-Excellence/Award-Recipients/Laurence-A.-Wolsey) on 2 February 2013. Retrieved 26 March 2013. 7. "2012 Dantzig Prize Citation" (http://www.mathopt.org/?nav=dantzig_2012). Mathematical Optimization Society. Retrieved 26 March 2013. 8. "And the Winners Are.." (http://www.mathopt.org/pdfs/OptimaISMP12-Aug-20.pdf) (PDF). Optima. 20 August 2012. Retrieved 17 April 2013. External links Google Scholar report (https://scholar.google.ca/citations?user=ChLWT2oAAAAJ&hl=en) "L. A. Wolsey short CV" (https://web.archive.org/web/20110127015435/http://www.core.ucl.ac.be/~wolsey/ShortC V.htm). Archived from the original (http://www.core.ucl.ac.be/~wolsey/ShortCV.htm) on 27 January 2011. Retrieved 26 March 2013. INFORMS (https://www.informs.org/About-INFORMS/History-and-Traditions/Biographical-Profiles/Wolsey-Lauren ce-A): Biography of Laurence Wolsey from the Institute for Operations Research and the Management Sciences Retrieved from "https://en.wikipedia.org/w/index.php?title=Laurence_Wolsey&oldid=815962723" This page was last edited on 18 December 2017, at 10:08. Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. https://en.wikipedia.org/wiki/Laurence_Wolsey 2/2.
Load more

Recommended publications
  • Prizes and Awards Session
    PRIZES AND AWARDS SESSION Wednesday, July 12, 2021 9:00 AM EDT 2021 SIAM Annual Meeting July 19 – 23, 2021 Held in Virtual Format 1 Table of Contents AWM-SIAM Sonia Kovalevsky Lecture ................................................................................................... 3 George B. Dantzig Prize ............................................................................................................................. 5 George Pólya Prize for Mathematical Exposition .................................................................................... 7 George Pólya Prize in Applied Combinatorics ......................................................................................... 8 I.E. Block Community Lecture .................................................................................................................. 9 John von Neumann Prize ......................................................................................................................... 11 Lagrange Prize in Continuous Optimization .......................................................................................... 13 Ralph E. Kleinman Prize .......................................................................................................................... 15 SIAM Prize for Distinguished Service to the Profession ....................................................................... 17 SIAM Student Paper Prizes ....................................................................................................................
    [Show full text]
  • A New Column for Optima Structure Prediction and Global Optimization
    76 o N O PTIMA Mathematical Programming Society Newsletter MARCH 2008 Structure Prediction and A new column Global Optimization for Optima by Alberto Caprara Marco Locatelli Andrea Lodi Dip. Informatica, Univ. di Torino (Italy) Katya Scheinberg Fabio Schoen Dip. Sistemi e Informatica, Univ. di Firenze (Italy) This is the first issue of 2008 and it is a very dense one with a Scientific February 26, 2008 contribution on computational biology, some announcements, reports of “Every attempt to employ mathematical methods in the study of chemical conferences and events, the MPS Chairs questions must be considered profoundly irrational and contrary to the spirit in chemistry. If mathematical analysis should ever hold a prominent place Column. Thus, the extra space is limited in chemistry — an aberration which is happily almost impossible — it but we like to use few additional lines would occasion a rapid and widespread degeneration of that science.” for introducing a new feature we are — Auguste Comte particularly happy with. Starting with Cours de philosophie positive issue 76 there will be a Discussion Column whose content is tightly related “It is not yet clear whether optimization is indeed useful for biology — surely biology has been very useful for optimization” to the Scientific contribution, with ­ — Alberto Caprara a purpose of making every issue of private communication Optima recognizable through a special topic. The Discussion Column will take the form of a comment on the Scientific 1 Introduction contribution from some experts in Many new problem domains arose from the study of biological and the field other than the authors or chemical systems and several mathematical programming models an interview/discussion of a couple as well as algorithms have been developed.
    [Show full text]
  • Technical Sessions
    T ECHNICAL S ESSIONS Sunday, 8:00am - 9:30am How to Navigate the Technical Sessions ■ SA01 There are three primary resources to help you C-Room 21, Upper Level understand and navigate the Technical Sessions: Panel Discussion: The Society of Decision • This Technical Session listing, which provides the Professionals - Building a True Profession most detailed information. The listing is presented Sponsor: Decision Analysis chronologically by day/time, showing each session Sponsored Session and the papers/abstracts/authors within each Chair: Carl Spetzler, Chairman & CEO, Strategic Decisions Group (SDG), 745 Emerson St, Palo Alto, CA, 94301, United States of session. America, [email protected] • The Session Chair, Author, and Session indices 1 - The Society of Decision Professionals - Building a provide cross-reference assistance (pages 426-463). True Profession Moderator: Carl Spetzler, Chairman & CEO, Strategic Decisions • The Track Schedule is on pages 46-53. This is an Group (SDG), 745 Emerson St, Palo Alto, CA, 94301, United overview of the tracks (general topic areas) and States of America, [email protected], Panelist: Larry Neal, when/where they are scheduled. David Leonhardi, Hannah Winter, Jack Kloeber, Andrea Dickens When we take stock of 40 years of Decision Analysis practice. Decision professionals still assist in only a small fraction of important and difficult choices. In this panel, practitioners will explore why this is the case and discuss how to Quickest Way to Find Your Own Session form a true profession to transform the way important and difficult decisions are Use the Author Index (pages 430-453) — the session made. code for your presentation(s) will be shown along with the track number.
    [Show full text]
  • ISMP BP Front
    Conference Program 1 TABLE OF CONTENTS Welcome from the Chair . 2 Schedule of Daily Events & Sessions . 3 20TH INTERNATIONAL SYMPOSIUM ON Speaker Information . 5 MATHEMATICAL PROGRAMMING August 23-28, 2009 Social Events & Excursions . 6 Chicago, Illinois, USA Internet Access . 7 Opening Session & Prizes . 8 Area Map . 9 PROGRAM ORGANIZING COMMITTEE COMMITTEE Exhibitors . 10 Chair Mihai Anitescu John R. Birge Argonne National Lab Plenary & Semi-Plenary Sessions . 12 University of Chicago USA Track Schedule . 17 USA John R. Birge Karen Aardal University of Chicago Floor Plans & Maps . 22 Centrum Wiskunde & USA Informatica Michael Ferris Cluster Chairs . 24 The Netherlands University of Wisconsin- Michael Ferris Madison Technical Sessions University of Wisconsin- USA Monday . 25 Madison Jeff Linderoth USA University of Wisconsin- Tuesday . 49 Michael Goemans Madison Wednesday . 74 Massachusetts Institute of USA Thursday . 98 Technology Todd Munson USA Argonne National Lab Friday . 121 Michael Jünger USA Universität zu Köln Jorge Nocedal Session Chair Index . 137 Germany Northwestern University Masakazu Kojima USA Author Index . 139 Tok yo Institute of Technology Jong-Shi Pang Session Index . 147 Japan University of Illinois at Urbana- Rolf Möhring Champaign Advertisers Technische Universität Berlin USA World Scientific . .150 Germany Stephen J. Wright Andy Philpott University of Wisconsin- IOS Press . .151 University of Auckland Madison OptiRisk Systems . .152 New Zealand USA Claudia Sagastizábal Taylor & Francis . .153 CEPEL LINDO Systems . .154 Brazil Springer . .155 Stephen J. Wright University of Wisconsin- Mosek . .156 Madison USA Sponsors . Back Cover Yinyu Ye Stanford University USA 2 Welcome from the Chair On behalf of the Organizing Committee and The University of Chicago, I The University of Chicago welcome you to ISMP 2009, the 20th International Symposium on Booth School of Business Mathematical Programming.
    [Show full text]
  • Integer Programming
    50 Years of Integer Programming 1958–2008 Michael Junger¨ · Thomas Liebling · Denis Naddef · George Nemhauser · William Pulleyblank · Gerhard Reinelt · Giovanni Rinaldi · Laurence Wolsey Editors 50 Years of Integer Programming 1958–2008 From the Early Years to the State-of-the-Art 123 Editors Michael Junger¨ Thomas M. Liebling Universitat¨ zu Koln¨ Ecole Polytechnique Fed´ erale´ de Lausanne Institut fur¨ Informatik Faculte´ des Sciences de Base Pohligstraße 1 Institut de Mathematiques´ 50969 Koln¨ Station 8 Germany 1015 Lausanne [email protected] Switzerland Denis Naddef thomas.liebling@epfl.ch Grenoble Institute of Technology - Ensimag George L. Nemhauser Laboratoire G-SCOP Industrial and Systems Engineering 46 avenue Felix´ Viallet Georgia Institute of Technology 38031 Grenoble Cedex 1 Atlanta, GA 30332-0205 France USA [email protected] [email protected] William R. Pulleyblank Gerhard Reinelt IBM Corporation Universitat¨ Heidelberg 294 Route 100 Institut fur¨ Informatik Somers NY 10589 Im Neuenheimer Feld 368 USA 69120 Heidelberg [email protected] Germany Giovanni Rinaldi [email protected] CNR - Istituto di Analisi dei Sistemi Laurence A. Wolsey ed Informatica “Antonio Ruberti” Universite´ Catholique de Louvain Viale Manzoni, 30 Center for Operations Research and 00185 Roma Econometrics (CORE) Italy voie du Roman Pays 34 [email protected] 1348 Louvain-la-Neuve Belgium [email protected] ISBN 978-3-540-68274-5 e-ISBN 978-3-540-68279-0 DOI 10.1007/978-3-540-68279-0 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2009938839 Mathematics Subject Classification (2000): 01-02, 01-06, 01-08, 65K05, 65K10, 90-01, 90-02, 90-03, 90-06, 90-08, 90C05, 90C06, 90C08, 90C09, 90C10, 90C11, 90C20, 90C22, 90C27, 90C30, 90C35, 90C46, 90C47, 90C57, 90C59, 90C60, 90C90 c Springer-Verlag Berlin Heidelberg 2010 This work is subject to copyright.
    [Show full text]
  • Programming (ISMP 2015), the Most Important Meeting of the Mathematical Optimization Society (MOS)
    I S M P THANKS TO OUR SPONSORS 2 0 1 5 2 2 n d I LEADERSHIP SPONSOR n t e r n a t i o n a l S y m p o s i u m o Opening Ceremony and Reception n M a t h e m a GENERAL SPONSORS t i c a l P r o g r a The Optimization Firm m m i n g Conference Cruise & Banquet Session Signage Conference Badge Notepad and Pen Mobile App AV Technology P i t t s b u r g h , P e n n Student Travel Assistance Coffee Break General Support s y l v a n i a , U S A TABLE OF CONTENTS i PROGRAM COMMITTEE LOCAL ORGANIZING COMMITTEE Welcome from the Chair ii Chair Chair Schedule of Daily Events and Sessions iii Gérard P. Cornuéjols François Margot Carnegie Mellon University Carnegie Mellon University Cluster Chairs v USA Speaker Information vi Egon Balas Egon Balas Carnegie Mellon University Internet Access vii Carnegie Mellon University USA Lorenz T. Biegler Conference Mobile App vii Carnegie Mellon University Xiaojun Chen Where to go for Lunch vii The Hong Kong Polytechnic University Gérard P. Cornuéjols Opening Ceremony & Reception viii China Carnegie Mellon University Conference Cruise & Banquet ix Monique Laurent Iganacio E. Grossmann CWI Amsterdam Carnegie Mellon University Plenary & Semi-Plenary Lectures x The Netherlands John Hooker Exhibitors xv Sven Leyffer Carnegie Mellon University Master Track Schedules xvii Argonne National Laboratory USA Fatma Kilinç-Karzan Floor Plans xxii Carnegie Mellon University Arkadi Nemirovski Georgia Institute of Technology Javier F.
    [Show full text]
  • The Strength of Multi-Row Models1
    The strength of multi-row models1 Quentin Louveaux2 Laurent Poirrier3 Domenico Salvagnin4 October 6, 2014 Abstract We develop a method for computing facet-defining valid inequalities for any mixed-integer set PJ . While our practical implementation does not return only facet-defining inequalities, it is able to find a separating cut whenever one exists. The separator is not comparable in speed with the specific cutting-plane generators used in branch-and-cut solvers, but it is general-purpose. We can thus use it to compute cuts derived from any reasonably small relaxation PJ of a general mixed- integer problem, even when there exists no specific implementation for computing cuts with PJ . Exploiting this, we evaluate, from a computational perspective, the usefulness of cuts derived from several types of multi-row relaxations. In particular, we present results with four different strengthenings of the two-row intersection cut model, and multi-row models with up to fifteen rows. We conclude that only fully-strengthened two-row cuts seem to offer a significant advantage over two-row intersection cuts. Our results also indicate that the improvement obtained by going from models with very few rows to models with up to fifteen rows may not be worth the increased computing cost. 1 Overview In the last years, there has been a renewed interest in the MIP research community for finding new ways to compute general-purpose cutting-planes. Specifically, one of the subjects of attention was the generation of so-called multi-row cutting-planes, i.e. inequalities that are valid for relaxations with multiple rows of the problem to be solved.
    [Show full text]
  • Michel Balinski (Oct
    LE BULLETIN DEVIENT N° 41 UN P EU DE ROA D E F POUR LA ROUTE SOCIÉTÉ FRANÇAISE DE RECHERCHE OPÉRATIONNELLE ET D’AIDE À LA DÉCISION À LA UNE MICHEL BALINSKI (OCT. 1933 – FÉV. 2019) Une vie exceptionnelle, un homme exceptionnel (p.4) Le Jugement Majoritaire raconté par Hermann BOULY (p.6) NOUVEAU Le bulletin fait peau neuve : lisez « On the ROAD » ! (p.3 et 24) FOCUS Parcoursup et la gestion des internats par Claire MATHIEU (p.12) OCTOBRE 2019 2 UN PEU DE ROADEF POUR LA ROUTE éditORial par Anna Robert Chères amies, chers amis de la ROADEF, Ce n’est pas sans émotion que nous publions aujourd’hui le premier numéro de On the ROAD, 41e bulletin de la ROADEF, désormais ainsi renommé. Nous l’avons souhaité résolument moderne, dynamique, et certainement en rupture avec les précédentes éditions. Nous espérons vivement que le design pétillant et la nouvelle ligne éditoriale d’On the ROAD vous apporteront à la fois fraîcheur et matière à penser, satisfaisant ainsi chacun des 2 hémisphères de notre cerveau. La plupart des rubriques ont été renommées pour mieux adhérer aux nouveaux contenus. La rubrique « hORs les murs » fait son entrée, mettant un coup de projecteur sur un sujet extérieur mais connexe à la Recherche Opérationnelle ou l’Aide à la Décision. Avec « rADicalement ROAD », retrouvez un article au cœur de notre domaine. Nous avons délibérément opté pour un nouveau magazine sans équations, ou peu… Dans le « repORtage », nous partons à la rencontre d’un homme, d’une femme, ou encore d’une équipe.
    [Show full text]
  • Final Program and Abstracts
    Final Program and Abstracts Sponsored by the SIAM Activity Group on Optimization The SIAM Activity Group on Optimization fosters the development of optimization theory, methods, and software -- and in particular the development and analysis of efficient and effective methods, as well as their implementation in high-quality software. It provides and encourages an environment for interaction among applied mathematicians, computer scientists, engineers, scientists, and others active in optimization. In addition to endorsing various optimization meetings, this activity group organizes the triennial SIAM Conference on Optimization, awards the SIAG/Optimization Prize, and sponsors minisymposia at the annual meeting and other SIAM conferences. The activity group maintains a wiki, a membership directory, and an electronic discussion group in which members can participate, and also publishes a newsletter - SIAG/OPT News and Views. Society for Industrial and Applied Mathematics 3600 Market Street, 6th Floor Philadelphia, PA 19104-2688 USA Telephone: +1-215-382-9800 Fax: +1-215-386-7999 Conference E-mail: [email protected] SIAM 2014 Events Mobile App Conference Web: www.siam.org/meetings/ Scan the QR code with any QR reader and Membership and Customer Service: download the TripBuilder EventMobile™ (800) 447-7426 (US & Canada) or app to your iPhone, iPad, iTouch or +1-215-382-9800 (worldwide) Android mobile device.You can also visit www.siam.org/meetings/op14 www.tripbuilder.com/siam2014events 2 2014 SIAM Conference on Optimization Table of Contents SIAM Registration Desk Child Care The SIAM registration desk is located in For local childcare information, please Program-at-a-Glance the Golden Foyer. It is open during the contact the concierge at the Town and .................................
    [Show full text]
  • Optimizaç˜Ao References
    Departamento de Matem´atica 2o semestre 2003/2004 Universidade de Coimbra Bibliografia Optimiza¸c˜ao References [1] Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows. Prentice Hall Inc., Englewood Cliffs, NJ, 1993. Theory, algorithms, and applications. [2] Mokhtar S. Bazaraa, John J. Jarvis, and Hanif D. Sherali. Linear programming and network flows. John Wiley & Sons Inc., New York, second edition, 1990. [3] Mokhtar S. Bazaraa and C. M. Shetty. Nonlinear programming. John Wiley & Sons, New York-Chichester-Brisbane, 1979. Theory and algorithms. [4] Dimitri P. Bertsekas. Constrained optimization and Lagrange multiplier methods. Computer Science and Applied Mathematics. Academic Press Inc. [Harcourt Brace Jovanovich Publish- ers], New York, 1982. [5] D. P. Bertsekas. Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont, Massachusetts, 1998. [6] John T. Betts. Practical methods for optimal control using nonlinear programming. Advances in Design and Control. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2001. [7] Ake˚ Bj¨orck. Numerical methods for least squares problems. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1996. [8] Richard P. Brent. Algorithms for minimization without derivatives. Prentice-Hall Inc., En- glewood Cliffs, N.J., 1973. Prentice-Hall Series in Automatic Computation. [9] Richard A. Brualdi and Herbert J. Ryser. Combinatorial matrix theory, volume 39 of En- cyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 1991. [10] Gary Chartrand and Linda Lesniak. Graphs & digraphs. Chapman & Hall, London, third edition, 1996. [11] Vaˇsek Chv´atal. Linear programming. A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York, 1983.
    [Show full text]
  • INFORMS OS Today 1(1) Pdfsubject
    INFORMS OS Today The Newsletter of the INFORMS Optimization Society Volume 1 Number 1 March 2011 Contents Chair's Column .................................1 Chair's Column Nominations for OS Prizes .....................13 Nominations for OS Officers ...................14 Jon Lee Announcing the 4th OS Conference . .15 IBM T.J. Watson Research Center Yorktown Heights, NY 10598 ([email protected]) Featured Articles Hooked on Optimization George Nemhauser . 2 With this inaugural issue, the INFORMS Op- First Order Methods for Large Scale Optimization: timization Society is publishing a new newsletter: Error Bounds and Convergence Analysis \INFORMS OS Today." It is a great pleasure to Zhi-Quan Luo . 7 welcome Shabbir Ahmed ([email protected]) Probability Inequalities for Sums of Random Matri- as its Editor. Our plan is to start by publishing one ces and Their Applications in Optimization issue each Spring. At some point we may add a Fall Anthony Man-Cho So . 10 issue. Please let us know what you think about the newsletter. Fast Multiple Splitting Algorithms for Convex Opti- The current issue features articles by the 2010 mization OS prize winners: George Nemhauser (Khachiyan Shiqian Ma . .11 Prize for Life-time Accomplishments in Optimiza- tion), Zhi-Quan (Tom) Luo (Farkas Prize for Mid- career Researchers), Anthony Man-Cho So (Prize for Young Researchers), and Shiqian Ma (Student Pa- per Prize). Each of these articles describes the prize- winning work in a compact form. Also, in this issue, we have announcements of key activities for the OS: Calls for nominations for the 2011 OS prizes, a call for nominations of candidates for OS officers, and the 2012 OS Conference (to be held at the University of Miami, February 24{26, Send your comments and feedback to the Editor: 2012).
    [Show full text]
  • Readingsample
    50 Years of Integer Programming 1958-2008 From the Early Years to the State-of-the-Art Bearbeitet von Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey 1st Edition. 2009. Buch. xx, 804 S. ISBN 978 3 540 68274 5 Format (B x L): 15,5 x 23,5 cm Gewicht: 1345 g Weitere Fachgebiete > Mathematik > Stochastik > Wahrscheinlichkeitsrechnung Zu Inhaltsverzeichnis schnell und portofrei erhältlich bei Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert auf Fachbücher, insbesondere Recht, Steuern und Wirtschaft. Im Sortiment finden Sie alle Medien (Bücher, Zeitschriften, CDs, eBooks, etc.) aller Verlage. Ergänzt wird das Programm durch Services wie Neuerscheinungsdienst oder Zusammenstellungen von Büchern zu Sonderpreisen. Der Shop führt mehr als 8 Millionen Produkte. Chapter 12 Fifty-Plus Years of Combinatorial Integer Programming William Cook Abstract Throughout the history of integer programming, the field has been guided by research into solution approaches to combinatorial problems. We discuss some of the highlights and defining moments of this area. 12.1 Combinatorial integer programming Integer-programming models arise naturally in optimization problems over com- binatorial structures, most notably in problems on graphs and general set systems. The translation from combinatorics to the language of integer programming is often straightforward, but the new rendering typically suggests direct lines of attack via linear programming. As an example, consider the stable-set problem in graphs. Given a graph G = (V,E) with vertices V and edges E, a stable set of G is a subset S V such that no two vertices in S are joined by an edge.
    [Show full text]