DOCSLIB.ORG

Programming (ISMP 2015), the Most Important Meeting of the Mathematical Optimization Society (MOS)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

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. Peña USA Carnegie Mellon University Technical Sessions 1 Monday 1 Jorge Nocedal Oleg A. Prokopyev Northwestern University University of Pittsburgh Tuesday 41 USA Kirk Pruhs Wednesday 71 Andrzej Ruszczynski University of Pittsburgh Thursday 101 Rutgers University´ USA Nikolaos V. Sahinidis Friday 140 Carnegie Mellon University Claudia Sagastizábal IMPA Rio de Janeiro (Visiting Researcher) Andrew J. Schaefer Brazil University of Pittsburgh Session Chair Index 168 David P. Williamson Michael A. Trick Author Index 170 Cornell University Carnegie Mellon University Session Index 180 USA Willem-Jan van Hoeve Laurence Wolsey Carnegie Mellon University Université Catholique de Louvain Belgium ii WELCOME FROM THE CHAIR Tepper School of Business Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PA 15213-3890 It is a pleasure to welcome you to the 22nd International Symposium on Mathematical Programming (ISMP 2015), the most important meeting of the Mathematical Optimization Society (MOS). Over the past 10 years, the triennial ISMP meetings have grown significantly, and the 2015 edition will feature roughly 1,500 technical presentations covering all aspects of mathematical optimization. The expertise of the INFORMS staff in managing the administration of the conference has been a tremendous help, as well as the use of INFORMS' web registration and abstract processing infrastructure. The local organization has been a joint venture of the University of Pittsburgh and Carnegie Mellon University. Despite having campuses located side by side and having together more than 35,000 students, it proved impossible to organize ISMP on campus(es). We hope that the conference hotel in downtown Pittsburgh will prove convenient and comfortable. Don't forget that the universities are a short bus ride from the conference and visiting them could give you a different feel for Pittsburgh than your downtown experience. Pittsburgh is a pleasant city to live in, but discovering its most attractive sides requires some effort. Its many ethnic neighborhoods, each with a specific atmosphere, are worth a look. You might be aware that Pittsburgh has been a movie set for several blockbuster films ("Batman: The Dark Knight Rises" is the most recent one), and the number and diversity of cultural events offering is remarkable for a city its size. The faint of heart might want to avoid some local delicacies (e.g., a sandwich of fried bologna, egg, french fries, and cole slaw), but good Italian, Polish, and Hungarian dishes can be found (even if you are Italian, Polish, or Hungarian). We hope that you will find the Symposium both enjoyable and valuable. François Margot Tepper School of Business Carnegie Mellon University DAILY EVENTS AND SESSIONS iii SUNDAY, JULY 12 3:00pm-6:00pm Registration Grand Ballroom Foyer NOTE: 6:00pm-7:30pm Opening Ceremony Grand Ballroom All events are held in the Wyndham 7:30pm-9:00pm Welcome Reception Kings Garden Ballroom Grand Pittsburgh unless otherwise indicated. For technical session rooms, see the Track Schedule on pages xvii-xxi. MONDAY, JULY 13 8:00am-5:30pm Registration Grand Ballroom Foyer 9:00am-5:30pm Exhibits Grand Ballroom Foyer BADGES REQUIRED FOR TECHNICAL SESSIONS 9:00am-9:50am Plenary: Jim Geelen Grand Ballroom 1 & 2 ISMP 2015 badges must be worn to all 9:50am-10:20am Coffee Break Grand Ballroom Foyer sessions and events. Attendees without 10:20am-11:50am Technical Sessions (MB) Lobby & Ballroom Levels badges will be directed to the registra- 11:50am-1:10pm Lunch Break (on your own) tion desk to register and pick up their badges. All attendees, including speakers, 1:10pm-2:40pm Technical Sessions (MC) Lobby & Ballroom Levels cluster chairs and session chairs, must 2:45pm-4:15pm Technical Sessions (MD) Lobby & Ballroom Levels register and pay the registration fee. 4:15pm-4:35pm Coffee Break Grand Ballroom Foyer 4:35pm-5:25pm Semi-Plenary: Roberto Cominetti Grand Ballroom 1 COFFEE BREAKS 4:35pm-5:25pm Semi-Plenary: Pascal van Hentenryck Grand Ballroom 2 All coffee breaks will be held in the 5:30pm-7:00pm Technical Sessions(MF) Lobby & Ballroom Levels Grand Ballroom Foyer of the Wyndham Hotel. TUESDAY, JULY 14 8:00am-5:30pm Registration Grand Ballroom Foyer 9:00am-5:30pm Exhibits Grand Ballroom Foyer 9:00am-9:50am Plenary: Laurent El Ghaoui Grand Ballroom 1 & 2 9:50am-10:20am Coffee Break Grand Ballroom Foyer 10:20am-11:50am Technical Sessions (TB) Lobby & Ballroom Levels 11:50am-1:10pm Lunch Break (on your own) 1:10pm-2:40pm Technical Sessions (TC) Lobby & Ballroom Levels 2:45pm-4:15pm Technical Sessions (TD) Lobby & Ballroom Levels 4:15pm-4:35pm Coffee Break Grand Ballroom Foyer 4:35pm-5:25pm Semi-Plenary: Samuel Burer Grand Ballroom 1 4:35pm-5:25pm Semi-Plenary: Asu Özdaglar Grand Ballroom 2 5:30pm-6:30pm MOS Business Meeting (open to all) Kings Garden 5 6:45pm-8:00pm Optimization Discussion Group Kings Garden 4 Sponsor: INFORMS Optimization Society (open to all) iv DAILY EVENTS AND SESSIONS WEDNESDAY, JULY 15 8:00am-5:30pm Registration Grand Ballroom Foyer 9:00am-4:45pm Exhibits Grand Ballroom Foyer 9:00am-9:50am Plenary: Stephen Wright Grand Ballroom 1 & 2 9:50am-10:20am Coffee Break Grand Ballroom Foyer 10:20am-11:50am Technical Sessions (WB) Lobby & Ballroom Levels 11:50am-1:10pm Lunch Break (on your own) 1:10pm-2:40pm Technical Sessions (WC) Lobby & Ballroom Levels 2:45pm-4:15pm Technical Sessions (WD) Lobby & Ballroom Levels 4:15pm-4:35pm Coffee Break Grand Ballroom Foyer 4:35pm-5:25pm Semi-Plenary: Michele Conforti Grand Ballroom 1 4:35pm-5:25pm Semi-Plenary: Tamara G. Kolda Grand Ballroom 2 5:30pm-6:20pm Tseng Memorial Lecture Grand Ballroom 1 6:50pm-10:00pm Conference Cruise & Banquet Wyndham Lobby Meet in the lobby at 6:50pm for walk to boat THURSDAY, JULY 16 8:00am-5:30pm Registration Grand Ballroom Foyer 9:00am-9:50am Plenary: Daniel Kuhn Grand Ballroom 1 & 2 9:50am-10:20am Coffee Break Grand Ballroom Foyer 10:20am-11:50am Technical Sessions (ThB) Lobby & Ballroom Levels 11:50am-1:10pm Lunch Break (on your own) 1:10pm-2:40pm Technical Sessions (ThC) Lobby & Ballroom Levels 2:45pm-4:15pm Technical Sessions (ThD) Lobby & Ballroom Levels 4:15pm-4:35pm Coffee Break Grand Ballroom Foyer 4:35pm-5:25pm Semi-Plenary: Andrea Lodi Grand Ballroom 1 4:35pm-5:25pm Semi-Plenary: Werner Römisch Grand Ballroom 2 5:30pm-7:00pm Technical Sessions (ThF) Lobby & Ballroom Levels FRIDAY, JULY 17 8:00am-4:30pm Registration Grand Ballroom Foyer 9:00am-9:50am Plenary: Daniel Spielman Grand Ballroom 1 & 2 9:50am-10:20am Coffee Break Grand Ballroom Foyer 10:20am-11:50am Technical Sessions (FB) Lobby & Ballroom Levels 11:50am-1:10pm Lunch Break (on your own) 1:10pm-2:40pm Technical Sessions (FC) Lobby & Ballroom Levels 2:45pm-4:15pm Technical Sessions (FD) Lobby & Ballroom Levels 4:15pm-4:35pm Coffee Break Grand Ballroom Foyer 4:35pm-5:25pm Semi-Plenary: Frank Vallentin Grand Ballroom 1 4:35pm-5:25pm Semi-Plenary: Ya-xiang Yuan Grand Ballroom 2 CLUSTER CHAIRS v Approximation and Online Finance and Economics Logistics Traffic and PDE-Constrained Algorithms Pavlo Krokhmal Transportation Optimization and Multi- Clifford Stein University of Iowa Patrice Marcotte Level/Multi-Grid Methods Columbia University USA Université de Montréal Matthias Heinkenschloss USA Karl Schmedders Canada Rice University David B. Shmoys Universität Zürich Huseyin Topaloglu USA Cornell University Switzerland Cornell University Michael Hintermüller USA USA Humboldt-Universität Berlin Game Theory Germany Combinatorial Optimization Shuchi Chawla Mixed-Integer Nonlinear Volker Kaibel Univ. of Wisconsin-Madison Programming Robust Optimization Otto-von-Guericke-Universität USA Sven Leyffer Dimitris Bertsimas Magdeburg Nicole Immorlica Argonne National Laboratory Mass. Institute of Technology Germany Microsoft Research New England USA USA Andreas S. Schulz USA Jeffrey T. Linderoth Dick den Hertog Mass.Institute of Technology Univ. of Wisconsin-Madison Tilburg University USA Global Optimization USA The Netherlands Jean-Philippe P. Richard Complementarity and University of Florida Multi-Objective Optimization Sparse Optimization Variational Inequalities USA Matthias Ehrgott and Applications Michael C. Ferris Mohit Tawarmalani Lancaster University Maryam Fazel Univ.of Wisconsin-Madison Purdue University United Kingdom University of Washington USA USA Kaisa Miettinen USA Jong-Shi Pang Univeristy of Jyväskylä Michael P.
Recommended publications
  • Arkadi Nemirovski (PDF)

    Arkadi Nemirovski (PDF)

    Arkadi Nemirovski Mr. Chancellor, I present Arkadi Nemirovski. For more than thirty years, Arkadi Nemirovski has been a leader in continuous optimization. He has played central roles in three of the major breakthroughs in optimization, namely, the ellipsoid method for convex optimization, the extension of modern interior-point methods to convex optimization, and the development of robust optimization. All of these contributions have had tremendous impact, going significantly beyond the original domain of the discoveries in their theoretical and practical consequences. In addition to his outstanding work in optimization, Professor Nemirovski has also made major contributions in the area of nonparametric statistics. Even though the most impressive part of his work is in theory, every method, every algorithm he proposes comes with a well-implemented computer code. Professor Nemirovski is widely admired not only for his brilliant scientific contributions, but also for his gracious humility, kindness, generosity, and his dedication to students and colleagues. Professor Nemirovski has held chaired professorships and many visiting positions at top research centres around the world, including an adjunct professor position in the Department of Combinatorics and Optimization at Waterloo from 2000-2004. Since 2005, Professor Nemirovski has been John Hunter Professor in the School of Industrial and Systems Engineering at the Georgia Institute of Technology. Among many previous honours, he has received the Fulkerson Prize from the American Mathematical Society and the Mathematical Programming Society in 1982, the Dantzig Prize from the Society for Industrial and Applied Mathematics and the Mathematical Programming Society in 1991, and the John von Neumann Theory Prize from the Institute for Operations Research and the Management Sciences in 2003.
  • Some Aspects of the Optimization Over the Copositive and the Completely Positive Cone

    Some Aspects of the Optimization Over the Copositive and the Completely Positive Cone

    Some aspects of the optimization over the copositive and the completely positive cone Dissertation zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) Dem Fachbereich IV der Universit¨at Trier vorgelegt von Julia Witzel Trier, 2013 Eingereicht am 17.07.2013 Gutachter: Prof. Dr. Mirjam Dur¨ Prof. Dr. Gabriele Eichfelder Tag der mundlichen¨ Prufung:¨ 25.09.2013 Die Autorin hat im Laufe des Promotionsverfahrens geheiratet und hieß zu dessen Beginn Julia Sponsel. Zusammenfassung Optimierungsprobleme tauchen in vielen praktischen Anwendungsbereichen auf. Zu den einfachsten Problemen geh¨oren lineare Optimierungsprobleme. Oft reichen lineare Probleme allerdings zur Modellierung praktischer Anwendun- gen nicht aus, sondern es muss die Ganzzahligkeit von Variablen gefordert werden oder es tauchen nichtlineare Nebenbedingungen oder eine nichtlineare Zielfunktion auf. Eine wichtige Problemklasse stellen hierbei quadratische Pro- bleme dar, welche im Allgemeinen aber schwer zu l¨osen sind. Ein Ansatz, der sich in den letzten Jahren entwickelt und verbreitet hat, besteht in der Umfor- mulierung quadratischer Probleme in sogenannte kopositive Programme. Ko- positive Programme sind lineare Optimierungsprobleme uber¨ dem Kegel der kopositiven Matrizen n×n T T n Cn = fA 2 R : A = A ; x Ax ≥ 0 fur¨ alle x 2 R ; x ≥ 0g; oder dem Dualkegel, dem Kegel der vollst¨andig positiven Matrizen m ∗ n X T n o Cn = xixi : xi 2 R ; xi ≥ 0 fur¨ alle i = 1; : : : ; m : i=1 Die Schwierigkeit dieser Probleme liegt in der Kegelbedingung. Aber nicht nur das Optimieren uber¨ diesen Kegeln ist schwierig. Wie von Murty und Kabadi (1987) und Dickinson und Gijben (2013) gezeigt ist es NP-schwer zu testen, ob eine gegebene Matrix kopositiv oder vollst¨andig positiv ist.
  • Using the COIN-OR Server

    Using the COIN-OR Server

    Using the COIN-OR Server Your CoinEasy Team November 16, 2009 1 1 Overview This document is part of the CoinEasy project. See projects.coin-or.org/CoinEasy. In this document we describe the options available to users of COIN-OR who are interested in solving opti- mization problems but do not wish to compile source code in order to build the COIN-OR projects. In particular, we show how the user can send optimization problems to a COIN-OR server and get the solution result back. The COIN-OR server, webdss.ise.ufl.edu, is 2x Intel(R) Xeon(TM) CPU 3.06GHz 512MiB L2 1024MiB L3, 2GiB DRAM, 4x73GiB scsi disk 2xGigE machine. This server allows the user to directly access the following COIN-OR optimization solvers: • Bonmin { a solver for mixed-integer nonlinear optimization • Cbc { a solver for mixed-integer linear programs • Clp { a linear programming solver • Couenne { a solver for mixed-integer nonlinear optimization problems and is capable of global optiomization • DyLP { a linear programming solver • Ipopt { an interior point nonlinear optimization solver • SYMPHONY { mixed integer linear solver that can be executed in either parallel (dis- tributed or shared memory) or sequential modes • Vol { a linear programming solver All of these solvers on the COIN-OR server may be accessed through either the GAMS or AMPL modeling languages. In Section 2.1 we describe how to use the solvers using the GAMS modeling language. In Section 2.2 we describe how to call the solvers using the AMPL modeling language. In Section 3 we describe how to call the solvers using a command line executable pro- gram OSSolverService.exe (or OSSolverService for Linux/Mac OS X users { in the rest of the document we refer to this executable using a .exe extension).
  • Generating Single and Multiple Cooperative Heuristics for the One Dimensional Bin Packing Problem Using a Single Node Genetic Programming Island Model

    Generating Single and Multiple Cooperative Heuristics for the One Dimensional Bin Packing Problem Using a Single Node Genetic Programming Island Model

    Generating Single and Multiple Cooperative Heuristics for the One Dimensional Bin Packing Problem Using a Single Node Genetic Programming Island Model Kevin Sim Emma Hart Institute for Informatics and Digital Innovation Institute for Informatics and Digital Innovation Edinburgh Napier University Edinburgh Napier University Edinburgh, Scotland, UK Edinburgh, Scotland, UK [email protected] [email protected] ABSTRACT exhibit superior performance than similar human designed Novel deterministic heuristics are generated using Single Node heuristics and can be used to produce collections of heuris- Genetic Programming for application to the One Dimen- tics that collectively maximise the potential of selective HH. sional Bin Packing Problem. First a single deterministic The papers contribution is two fold. Single heuristics ca- heuristic was evolved that minimised the total number of pable of outperforming a range of well researched deter- bins used when applied to a set of 685 training instances. ministic heuristics are generated by combining features ex- Following this, a set of heuristics were evolved using a form tracted from those heuristics. Secondly an island model[19] of cooperative co-evolution that collectively minimise the is adapted to use multiple SNGP implementations to gener- number of bins used across the same set of problems. Re- ate diverse sets of heuristics which collectively outperform sults on an unseen test set comprising a further 685 prob- any of the single heuristics when used in isolation. Both ap- lem instances show that the single evolved heuristic out- proaches are trained and evaluated using equal divisions of a performs existing deterministic heuristics described in the large set of 1370 benchmark problem instances sourced from literature.
  • 13. Mathematics University of Central Oklahoma

    13. Mathematics University of Central Oklahoma

    Southwestern Oklahoma State University SWOSU Digital Commons Oklahoma Research Day Abstracts 2013 Oklahoma Research Day Jan 10th, 12:00 AM 13. Mathematics University of Central Oklahoma Follow this and additional works at: https://dc.swosu.edu/ordabstracts Part of the Animal Sciences Commons, Biology Commons, Chemistry Commons, Computer Sciences Commons, Environmental Sciences Commons, Mathematics Commons, and the Physics Commons University of Central Oklahoma, "13. Mathematics" (2013). Oklahoma Research Day Abstracts. 12. https://dc.swosu.edu/ordabstracts/2013oklahomaresearchday/mathematicsandscience/12 This Event is brought to you for free and open access by the Oklahoma Research Day at SWOSU Digital Commons. It has been accepted for inclusion in Oklahoma Research Day Abstracts by an authorized administrator of SWOSU Digital Commons. An ADA compliant document is available upon request. For more information, please contact [email protected]. Abstracts from the 2013 Oklahoma Research Day Held at the University of Central Oklahoma 05. Mathematics and Science 13. Mathematics 05.13.01 A simplified proof of the Kantorovich theorem for solving equations using scalar telescopic series Ioannis Argyros, Cameron University The Kantorovich theorem is an important tool in Mathematical Analysis for solving nonlinear equations in abstract spaces by approximating a locally unique solution using the popular Newton-Kantorovich method.Many proofs have been given for this theorem using techniques such as the contraction mapping principle,majorizing sequences, recurrent functions and other techniques.These methods are rather long,complicated and not very easy to understand in general by undergraduate students.In the present paper we present a proof using simple telescopic series studied first in a Calculus II class.
  • 2019 AMS Prize Announcements

    2019 AMS Prize Announcements

    FROM THE AMS SECRETARY 2019 Leroy P. Steele Prizes The 2019 Leroy P. Steele Prizes were presented at the 125th Annual Meeting of the AMS in Baltimore, Maryland, in January 2019. The Steele Prizes were awarded to HARUZO HIDA for Seminal Contribution to Research, to PHILIppE FLAJOLET and ROBERT SEDGEWICK for Mathematical Exposition, and to JEFF CHEEGER for Lifetime Achievement. Haruzo Hida Philippe Flajolet Robert Sedgewick Jeff Cheeger Citation for Seminal Contribution to Research: Hamadera (presently, Sakai West-ward), Japan, he received Haruzo Hida an MA (1977) and Doctor of Science (1980) from Kyoto The 2019 Leroy P. Steele Prize for Seminal Contribution to University. He did not have a thesis advisor. He held po- Research is awarded to Haruzo Hida of the University of sitions at Hokkaido University (Japan) from 1977–1987 California, Los Angeles, for his highly original paper “Ga- up to an associate professorship. He visited the Institute for Advanced Study for two years (1979–1981), though he lois representations into GL2(Zp[[X ]]) attached to ordinary cusp forms,” published in 1986 in Inventiones Mathematicae. did not have a doctoral degree in the first year there, and In this paper, Hida made the fundamental discovery the Institut des Hautes Études Scientifiques and Université that ordinary cusp forms occur in p-adic analytic families. de Paris Sud from 1984–1986. Since 1987, he has held a J.-P. Serre had observed this for Eisenstein series, but there full professorship at UCLA (and was promoted to Distin- the situation is completely explicit. The methods and per- guished Professor in 1998).
  • Y Nesterov Introductory Lecture Notes on Convex Optimization

    Y Nesterov Introductory Lecture Notes on Convex Optimization

    Y Nesterov Introductory Lecture Notes On Convex Optimization Jean-Luc filter his minsters discrown thermochemically or undeservingly after Haskel moralised and etymologised terrestrially, thixotropic and ravaging. Funded Artur monopolizes, his screwings mars outboxes sixfold. Maynard is endways: she slave imperiously and planning her underpainting. To provide you signed in this paper we have described as such formulations is a different methodology than the lecture notes on convex optimization nesterov ebook, and prox function minimization in the mapping is based methods 10112015 First part led the lecture notes is available 29102015. Interior gradient ascent algorithms and difficult to note that achieves regret? Comprehensive Exam Syllabus for Continuous Optimization. Convex Optimization for rigorous Science. Register update notification mail Add to favorite lecture list Academic. Nesterov 2003 Introductory Lectures on Convex Optimization Springer. The flow polytope corresponds to note that arise in this. Lecture Notes IE 521 Convex Optimization Niao He. The most important properties of our methods were provided with inequality. Optimization UCLA Computer Science. This is in order information gathered in parallel. CVXPY A Python-Embedded Modeling Language for Convex. The random decision. The assumption that use of an efficient algorithms we note that ogd as well understood and not present can update method clarified on optimization, we assume that learns as labelled data. Introduction to Online Convex Optimization by Elad Hazan Foundations and. Yurii Nesterov Google Cendekia Google Scholar. 3 First order algorithms for online convex optimization 39. Nisheeth K Vishnoi Theoretical Computer Science EPFL. Convergence rates trust-region methods introduction to the AMPL modeling language. Introductory Lectures on Convex Optimization A Basic Course.
  • Curriculum Vitæ

    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.
  • Institute for Pure and Applied Mathematics, UCLA Award/Institution #0439872-013151000 Annual Progress Report for 2009-2010 August 1, 2011

    Institute for Pure and Applied Mathematics, UCLA Award/Institution #0439872-013151000 Annual Progress Report for 2009-2010 August 1, 2011

    Institute for Pure and Applied Mathematics, UCLA Award/Institution #0439872-013151000 Annual Progress Report for 2009-2010 August 1, 2011 TABLE OF CONTENTS EXECUTIVE SUMMARY 2 A. PARTICIPANT LIST 3 B. FINANCIAL SUPPORT LIST 4 C. INCOME AND EXPENDITURE REPORT 4 D. POSTDOCTORAL PLACEMENT LIST 5 E. INSTITUTE DIRECTORS‘ MEETING REPORT 6 F. PARTICIPANT SUMMARY 12 G. POSTDOCTORAL PROGRAM SUMMARY 13 H. GRADUATE STUDENT PROGRAM SUMMARY 14 I. UNDERGRADUATE STUDENT PROGRAM SUMMARY 15 J. PROGRAM DESCRIPTION 15 K. PROGRAM CONSULTANT LIST 38 L. PUBLICATIONS LIST 50 M. INDUSTRIAL AND GOVERNMENTAL INVOLVEMENT 51 N. EXTERNAL SUPPORT 52 O. COMMITTEE MEMBERSHIP 53 P. CONTINUING IMPACT OF PAST IPAM PROGRAMS 54 APPENDIX 1: PUBLICATIONS (SELF-REPORTED) 2009-2010 58 Institute for Pure and Applied Mathematics, UCLA Award/Institution #0439872-013151000 Annual Progress Report for 2009-2010 August 1, 2011 EXECUTIVE SUMMARY Highlights of IPAM‘s accomplishments and activities of the fiscal year 2009-2010 include: IPAM held two long programs during 2009-2010: o Combinatorics (fall 2009) o Climate Modeling (spring 2010) IPAM‘s 2010 winter workshops continued the tradition of focusing on emerging topics where Mathematics plays an important role: o New Directions in Financial Mathematics o Metamaterials: Applications, Analysis and Modeling o Mathematical Problems, Models and Methods in Biomedical Imaging o Statistical and Learning-Theoretic Challenges in Data Privacy IPAM sponsored reunion conferences for four long programs: Optimal Transport, Random Shapes, Search Engines and Internet MRA IPAM sponsored three public lectures since August. Noga Alon presented ―The Combinatorics of Voting Paradoxes‖ on October 5, 2009. Pierre-Louis Lions presented ―On Mean Field Games‖ on January 5, 2010.
  • Polyhedral Outer Approximations in Convex Mixed-Integer Nonlinear

    Polyhedral Outer Approximations in Convex Mixed-Integer Nonlinear

    Jan Kronqvist Polyhedral Outer Approximations in Polyhedral Outer Approximations in Convex Mixed-Integer Nonlinear Programming Approximations in Convex Polyhedral Outer Convex Mixed-Integer Nonlinear Programming Jan Kronqvist PhD Thesis in Process Design and Systems Engineering Dissertations published by Process Design and Systems Engineering ISSN 2489-7272 Faculty of Science and Engineering 978-952-12-3734-8 Åbo Akademi University 978-952-12-3735-5 (pdf) Painosalama Oy Åbo 2018 Åbo, Finland 2018 2018 Polyhedral Outer Approximations in Convex Mixed-Integer Nonlinear Programming Jan Kronqvist PhD Thesis in Process Design and Systems Engineering Faculty of Science and Engineering Åbo Akademi University Åbo, Finland 2018 Dissertations published by Process Design and Systems Engineering ISSN 2489-7272 978-952-12-3734-8 978-952-12-3735-5 (pdf) Painosalama Oy Åbo 2018 Preface My time as a PhD student began back in 2014 when I was given a position in the Opti- mization and Systems Engineering (OSE) group at Åbo Akademi University. It has been a great time, and many people have contributed to making these years a wonderful ex- perience. During these years, I was given the opportunity to teach several courses in both environmental engineering and process systems engineering. The opportunity to teach these courses has been a great experience for me. I want to express my greatest gratitude to my supervisors Prof. Tapio Westerlund and Docent Andreas Lundell. Tapio has been a true source of inspiration and a good friend during these years. Thanks to Tapio, I have been able to be a part of an inter- national research environment.
  • Prizes and Awards Session

    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 ....................................................................................................................
  • Performance of Optimization Software - an Update

    Performance of Optimization Software - an Update

    Performance of Optimization Software - an Update INFORMS Annual 2011 Charlotte, NC 13-18 November 2011 H. D. Mittelmann School of Math and Stat Sciences Arizona State University 1 Services we provide • Guide to Software: "Decision Tree" • http://plato.asu.edu/guide.html • Software Archive • Software Evaluation: "Benchmarks" • Archive of Testproblems • Web-based Solvers (1/3 of NEOS) 2 We maintain the following NEOS solvers (8 categories) Combinatorial Optimization * CONCORDE [TSP Input] Global Optimization * ICOS [AMPL Input] Linear Programming * bpmpd [AMPL Input][LP Input][MPS Input][QPS Input] Mixed Integer Linear Programming * FEASPUMP [AMPL Input][CPLEX Input][MPS Input] * SCIP [AMPL Input][CPLEX Input][MPS Input] [ZIMPL Input] * qsopt_ex [LP Input][MPS Input] [AMPL Input] Nondifferentiable Optimization * condor [AMPL Input] Semi-infinite Optimization * nsips [AMPL Input] Stochastic Linear Programming * bnbs [SMPS Input] * DDSIP [LP Input][MPS Input] 3 We maintain the following NEOS solvers (cont.) Semidefinite (and SOCP) Programming * csdp [MATLAB_BINARY Input][SPARSE_SDPA Input] * penbmi [MATLAB Input][MATLAB_BINARY Input] * pensdp [MATLAB_BINARY Input][SPARSE_SDPA Input] * sdpa [MATLAB_BINARY Input][SPARSE_SDPA Input] * sdplr [MATLAB_BINARY Input][SDPLR Input][SPARSE_SDPA Input] * sdpt3 [MATLAB_BINARY Input][SPARSE_SDPA Input] * sedumi [MATLAB_BINARY Input][SPARSE_SDPA Input] 4 Overview of Talk • Current and Selected(*) Benchmarks { Parallel LP benchmarks { MILP benchmark (MIPLIB2010) { Feasibility/Infeasibility Detection benchmarks