default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16. IPCO 2013: Valparaíso, Chile
- Michel X. Goemans, José Correa:
Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings. Lecture Notes in Computer Science 7801, Springer 2013, ISBN 978-3-642-36693-2 - Karen I. Aardal, Frederik von Heymann:
On the Structure of Reduced Kernel Lattice Bases. 1-12 - Ron Adany, Moran Feldman
, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir:
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. 13-24 - Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. 25-36 - Kent Andersen, Anders Nedergaard Jensen:
Intersection Cuts for Mixed Integer Conic Quadratic Sets. 37-48 - David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan:
Content Placement via the Exponential Potential Function Method. 49-61 - Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. 62-73 - Attila Bernáth, Gyula Pap:
Blocking Optimal Arborescences. 74-85 - Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer:
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. 86-97 - Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Complexity and Approximability Study of the Bilevel Knapsack Problem. 98-109 - Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang:
Matroid and Knapsack Center Problems. 110-122 - Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick:
Cut-Generating Functions. 123-132 - Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. 133-144 - Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez:
On Some Generalizations of the Split Closure. 145-156 - Michael Dinitz, Anupam Gupta:
Packing Interdiction and Partial Covering Problems. 157-168 - Hongbo Dong, Jeff T. Linderoth:
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators. 169-180 - Zachary Friggstad, Anupam Gupta, Mohit Singh:
An Improved Integrality Gap for Asymmetric TSP Paths. 181-192 - Bertrand Guenin, Leanne Stuive:
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids. 193-204 - Anupam Gupta, Viswanath Nagarajan:
A Stochastic Probing Problem with Applications. 205-216 - Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani:
Thrifty Algorithms for Multistage Robust Optimization. 217-228 - Stephan Held, Daniel Rotter:
Shallow-Light Steiner Arborescences with Vertex Delays. 229-241 - Ruben Hoeksma, Marc Uetz:
Two Dimensional Optimal Mechanism Design for a Sequencing Problem. 242-253 - Patrick Jaillet, José A. Soto, Rico Zenklusen:
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. 254-265 - Diego Alejandro Morán Ramírez, Santanu S. Dey:
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets. 266-277 - Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). 278-289 - Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. 290-301 - Vishnu Narayanan:
Facial Structure and Representation of Integer Hulls of Convex Sets. 302-313 - Tim Nonner, Maxim Sviridenko:
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. 314-323 - Neil Olver, Rico Zenklusen:
Chain-Constrained Spanning Trees. 324-335 - Thomas Rothvoß:
A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing. 336-348 - Thomas Rothvoß, Laura Sanità:
0/1 Polytopes with Quadratic Chvátal Rank. 349-361 - András Sebö:
Eight-Fifth Approximation for the Path TSP. 362-374 - Tasuku Soma:
Fast Deterministic Algorithms for Matrix Completion Problems. 375-386 - Maxim Sviridenko, Andreas Wiese:
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. 387-398
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-27 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
