Integer Programming and Combinatorial Optimization: 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings

429 Pages·2014·5.406 MB·English

by  Jon Lee, Jens Vygen (eds.)

Jon Lee
Jens Vygen (Eds.)
Integer Programming
4
9 and Combinatorial
4
8

S
C Optimization
N
L
17th International Conference, IPCO 2014
Bonn, Germany, June 23–25, 2014
Proceedings
123
Lecture Notes in Computer Science 8494
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
Jon Lee Jens Vygen (Eds.)
Integer Programming
and Combinatorial
Optimization
17th International Conference, IPCO 2014
Bonn, Germany, June 23-25, 2014
Proceedings
1 3
VolumeEditors
JonLee
UniversityofMichigan
DepartmentofIndustrialandOperationsEngineering
1205BealAvenue,AnnArbor,MI48109-2117,USA
E-mail:[email protected]
JensVygen
UniversityofBonn
ResearchInstituteforDiscreteMathematics
Lennéstr.2,53113Bonn,Germany
E-mail:[email protected]
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-319-07556-3 e-ISBN978-3-319-07557-0
DOI10.1007/978-3-319-07557-0
SpringerChamHeidelbergNewYorkDordrechtLondon
LibraryofCongressControlNumber:2014939557
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©SpringerInternationalPublishingSwitzerland2014
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof
thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation,
broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology
nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection
withreviewsorscholarlyanalysisormaterialsuppliedspecificallyforthepurposeofbeingenteredand
executedonacomputersystem,forexclusiveusebythepurchaserofthework.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheCopyrightLawofthePublisher’slocation,
inistcurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Permissionsforuse
maybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violationsareliabletoprosecution
undertherespectiveCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Whiletheadviceandinformationinthisbookarebelievedtobetrueandaccurateatthedateofpublication,
neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityforanyerrorsor
omissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,withrespecttothe
materialcontainedherein.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
Preface
This volume contains the 34 extended abstracts presented at IPCO 2014, the
17thConferenceonIntegerProgrammingandCombinatorialOptimization,held
June 23-25, 2014, in Bonn, Germany.
TheIPCOconferenceisundertheauspicesoftheMathematicalOptimization
Society.Itisheldeveryyear,exceptforthoseinwhichtheInternationalSympo-
sium on Mathematical Programming takes place. The conference is a forum for
researchersandpractitionersworkingonvariousaspectsofintegerprogramming
and combinatorial optimization. The aim is to present recent developments in
theory, computation, and applications in these areas. Traditionally, IPCO con-
sists of three days of non-parallel sessions, with no invited talks. More informa-
tion on IPCO and its history can be found at www.mathopt.org/?nav=ipco.
This year, there were 143 submissions, two of which were withdrawn before
the review process started. Each reviewed submission was reviewed by at least
three Program Committee members, often with the help of external reviewers.
The Program Committee met in Aussois in January 2014 and, after thorough
discussions, selected 34 papers to be presented at IPCO 2014 and included in
thisvolume.Therecordnumberofsubmissions,theirhighquality,andthemore
or less constant number of papers that can be accepted made this IPCO even
more competitive than previous editions, with an acceptance rate of less than
25%.
We would like to thank:
– AllauthorswhosubmittedextendedabstractstoIPCO;itisapleasuretosee
how activeall areasofintegerprogrammingandcombinatorialoptimization
are
– The members of the Program Committee, who graciously gave their time
and energy
– The external reviewers, whose expertise was instrumental in guiding our
decisions
– The EasyChair developers for their excellent platform making many things
so much easier
– Springer for their efficient cooperation in producing this volume
– The members of the Organizing Committee and all people in Bonn who
helped to make this conference possible
– The speakers of the summer school preceding IPCO: G´erard Cornu´ejols,
Andra´s Frank, Thomas Rothvoß, and David Shmoys
VI Preface
– The Mathematical Optimization Society and in particular the members of
its IPCO Steering Committee: Andreas Schulz, Andrea Lodi, and David
Williamson, for their help and advice.
March 2014 Jon Lee
Jens Vygen
Organization
Program Committee
Flavia Bonomo Universidad de Buenos Aires, Argentina
Sam Burer University of Iowa, USA
G´erard Cornu´ejols Carnegie Mellon University, USA
Satoru Fujishige Kyoto University, Japan
Michael Ju¨nger Universit¨at zu K¨oln
Matthias K¨oppe University of California, Davis, USA
Jon Lee (chair) University of Michigan, USA
Jeff Linderoth University of Wisconsin, USA
Jean-Philippe Richard University of Florida, USA
Andra´s Seb˝o CNRS, LaboratoireG-SCOP,Grenoble,France
Maxim Sviridenko University of Warwick, UK
Chaitanya Swamy University of Waterloo, Canada
Jens Vygen Universit¨at Bonn, Germany
David P. Williamson Cornell University, USA
Laurence Wolsey Universit´e catholique de Louvain, Belgium
Organizing Committee
Stephan Held (co-chair) Bernhard Korte
Stefan Hougardy Jens Vygen (chair)
Additional Reviewers
Aardal, Karen Bornstein, Claudson
Aharoni, Ron Boyar, Joan
Ahmadian, Sara Brenner, Ulrich
Albers, Susanne Breˇsar, Boˇstjan
An, Hyung-Chan Buchbinder, Niv
Ando, Kazutoshi Buchheim, Christoph
Argiroffo, Gabriela Butenko, Sergiy
Badanidiyuru, Ashwinkumar Byrka, Jarosl(cid:4)aw
Balasundaram, Baski Chrobak, Marek
Baldacci, Roberto Cornaz, Denis
Bansal, Nikhil de Klerk, Etienne
Bhaskar, Umang Dey, Santanu
B¨okler, Fritz Di Summa, Marco
VIII Organization
Dourado, Mitre Kortsarz, Guy
Duarte Pinto, Paulo Eust´aquio Krumke, Sven
Dvorak, Zdenek Kumar, Amit
Ehrgott, Matthias Letchford, Adam
Ene, Alina Li, Jian
Faenza, Yuri Li, Shi
Fanelli, Angelo Liers, Frauke
Feuerstein, Esteban Lin, Min Chih
Fiorini, Samuel Luedtke, James
Frank, Andra´s Madry, Aleksander
(cid:2)
Friggstad, Zachary Maffray, Fr´ed´eric
Gaspers, Serge Mallach, Sven
Gester, Michael Manlove, David
Gleixner, Ambros Margot, Fran¸cois
Goemans, Michel Martin, Alexander
Grigoriev, Alex Marx, Da´niel
Groß, Martin Matuschke, Jannik
Guenin, Bertrand McCormick, S. Thomas
Gu¨nlu¨k, Oktay Megow, Nicole
Gupta, Anupam Mestre, Julian
Gya´rfa´s, Andra´s Mirrokni, Vahab
H¨ahnle, Nicolai Miyazaki, Shuichi
Hajiaghayi, Mohammadtaghi Moldenhauer, Carsten
Harks, Tobias Moscardelli, Luca
Havet, Fr´ed´eric Moseley, Ben
Held, Stephan Mu¨ller, Dirk
Hirai, Hiroshi Murota, Kazuo
Hoefer, Martin Nagano, Kiyohito
Hungerl¨ander, Philipp Nagarajan,Viswanath
Im, Sungjin Newman, Alantha
Imai, Hiroshi Niedermeier, Rolf
Jansen, Klaus Ochsendorf, Philipp
Jeronimo, Gabriela Olver, Neil
Jorda´n, Tibor Oriolo, Gianpaolo
Kakimura, Naonori Ostrowski, Jim
Kamin´ski, Marcin Pferschy, Ulrich
Kamiyama, Naoyuki Pilipczuk, Marcin
Karakostas,George Pokutta, Sebastian
Karpinski, Marek Queyranne, Maurice
Kawahara,Jun Rautenbach, Dieter
Kelner, Jonathan Ravi, R.
Kir´aly, Tama´s Rinaldi, Giovanni
Kitahara,Tomonari R¨oglin, Heiko
Klewinghaus, Niko Rothvoß, Thomas
Kobayashi, Yusuke Rotter, Daniel
Organization IX
Sanit`a, Laura Szigeti, Zolta´n
Sassano, Antonio Takazawa, Kenjiro
Sau, Ignasi Tanigawa, Shin-ichi
Savelsbergh, Martin Trotignon, Nicolas
Sch¨afer, Till Tun¸cel, Levent
Schalekamp, Frans Uetz, Marc
Scheifele, Rudolf Van Vyve, Mathieu
Schieber, Baruch V´egh, L´aszl´o
Schmidt, Daniel Ventura, Paolo
Schneider, Jan Verschae, Jos´e
Schorr, Ulrike Vielma, Juan Pablo
Shepherd, Bruce Vishnoi, Nisheeth
Shigeno, Maiko Vondra´k, Jan
Shioura, Akiyoshi Ward, Justin
Silvanus, Jannik Wiese, Andreas
Silveira, Rodrigo Woeginger, Gerhard J.
Sitters, Ren´e Wollan, Paul
Skopalik, Alexander Wong, Prudence W.H.
Skutella, Martin Woods, Kevin
Smriglio, Stefano Wotzlaw, Andreas
Soto, Jos´e Young, Neal
Spirkl, Sophie Zenklusen, Rico
Spisla, Christiane van Zuylen, Anke
van Stee, Rob van der Zwaan, Ruben
Svensson, Ola Zwick, Uri
Table of Contents
The Cycling Property for the Clutter of Odd st-Walks................ 1
Ahmad Abdi and Bertrand Guenin
On Simplex Pivoting Rules and Complexity Theory .................. 13
Ilan Adler, Christos Papadimitriou, and Aviad Rubinstein
A Strongly Polynomial Time Algorithm for Multicriteria Global
Minimum Cuts .................................................. 25
Hassene Aissi, A. Ridha Mahjoub, S. Thomas McCormick, and
Maurice Queyranne
Integer Programswith PrescribedNumber of Solutions and a Weighted
Version of Doignon-Bell-Scarf’s Theorem............................ 37
Iskander Aliev, Jesu´s A. De Loera, and Quentin Louveaux
Centrality of Trees for Capacitated k-Center......................... 52
Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri,
Shalmoli Gupta, Vivek Madan, and Ola Svensson
Sequence Independent, Simultaneous and Multidimensional Lifting of
Generalized Flow Covers for the Semi-Continuous Knapsack Problem
with Generalized Upper Bounds Constraints......................... 64
Alejandro Angulo, Daniel Espinoza, and Rodrigo Palma
On the Unique-Lifting Property.................................... 76
Gennadiy Averkov and Amitabh Basu
Maximum Weighted Induced Bipartite Subgraphs and Acyclic
Subgraphs of Planar Cubic Graphs................................. 88
Mourad Ba¨ıou and Francisco Barahona
n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and
Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem ........ 102
Manish Bansal and Kiavash Kianfar
On the Adaptivity Gap of Stochastic Orienteering.................... 114
Nikhil Bansal and Viswanath Nagarajan
A Utility Equivalence Theorem for Concave Functions ................ 126
Anand Bhalgat and Sanjeev Khanna