default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18. IPCO 2016: Liege, Belgium
- Quentin Louveaux, Martin Skutella:
Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Lecture Notes in Computer Science 9682, Springer 2016, ISBN 978-3-319-33460-8 - Alberto Del Pia
:
On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming. 1-13 - Amitabh Basu, Timm Oertel:
Centerpoints: A Link Between Optimization and Convex Geometry. 14-25 - Daniel Dadush, László A. Végh, Giacomo Zambelli:
Rescaled Coordinate Descent Methods for Linear Programming. 26-37 - André Linhares, Chaitanya Swamy:
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. 38-49 - Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Max-Cut Under Graph Constraints. 50-62 - Mourad Baïou, Francisco Barahona:
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem. 63-76 - Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
Intersection Cuts for Bilevel Optimization. 77-88 - Thai Dinh, Ricardo Fukasawa, James R. Luedtke:
Exact Algorithms for the Chance-Constrained Vehicle Routing Problem. 89-101 - Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma:
Extended Formulations in Mixed-Integer Convex Programming. 102-113 - Mohit Singh, Rico Zenklusen:
k-Trails: Recognition, Complexity, and Approximations. 114-125 - Corinna Gottschalk, Jens Vygen:
Better s-t-Tours by Gao Trees. 126-137 - Ágnes Cseh, Telikepalli Kavitha:
Popular Edges and Dominant Matchings. 138-151 - Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. 152-163 - Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità:
Stabilizing Network Bargaining Games by Blocking Players. 164-177 - Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma:
Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over. 178-189 - Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme Functions with an Arbitrary Number of Slopes. 190-201 - Amitabh Basu, Robert Hildebrand, Marco Molinaro:
Minimal Cut-Generating Functions are Nearly Extreme. 202-213 - Alberto Del Pia, Jeffrey Poskin:
On the Mixed Binary Representability of Ellipsoidal Regions. 214-225 - Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). 226-237 - Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved Approximation Algorithms for Hitting 3-Vertex Paths. 238-249 - Anke van Zuylen:
Improved Approximations for Cubic Bipartite and Cubic TSP. 250-261 - Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal:
An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation. 262-274 - Cong Han Lim, Jeff T. Linderoth, James R. Luedtke:
Valid Inequalities for Separable Concave Constraints with Indicator Variables. 275-286 - Alfredo Torrico, Shabbir Ahmed, Alejandro Toriello:
A Polyhedral Approach to Online Bipartite Matching. 287-299 - Gérard Cornuéjols, Dabeen Lee:
On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank. 300-311 - James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust Monotone Submodular Function Maximization. 312-324 - Tasuku Soma, Yuichi Yoshida:
Maximizing Monotone Submodular Functions over the Integer Lattice. 325-336 - Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese:
Submodular Unsplittable Flow on Trees. 337-349 - Gábor Braun, Sebastian Pokutta, Aurko Roy:
Strong Reductions for Extended Formulations. 350-361 - Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. 362-374 - Nikhil Bansal, Viswanath Nagarajan:
Approximation-Friendly Discrepancy Rounding. 375-386 - Gérard Cornuéjols, Yanjun Li:
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point. 387-397 - Weijun Xie, Shabbir Ahmed:
On the Quantile Cut Closure of Chance-Constrained Problems. 398-409
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 2025-12-24 23:34 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:
