IPCO B

34 papers

YearTitle / Authors
2016A Polyhedral Approach to Online Bipartite Matching.
Alfredo Torrico, Shabbir Ahmed, Alejandro Toriello
2016An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation.
Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal
2016Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.
André Linhares, Chaitanya Swamy
2016Approximation-Friendly Discrepancy Rounding.
Nikhil Bansal, Viswanath Nagarajan
2016Better s-t-Tours by Gao Trees.
Corinna Gottschalk, Jens Vygen
2016Centerpoints: A Link Between Optimization and Convex Geometry.
Amitabh Basu, Timm Oertel
2016Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract).
Ola Svensson, Jakub Tarnawski, László A. Végh
2016Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.
Gérard Cornuéjols, Yanjun Li
2016Exact Algorithms for the Chance-Constrained Vehicle Routing Problem.
Thai Dinh, Ricardo Fukasawa, James R. Luedtke
2016Extended Formulations in Mixed-Integer Convex Programming.
Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma
2016Extreme Functions with an Arbitrary Number of Slopes.
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
2016Improved Approximation Algorithms for Hitting 3-Vertex Paths.
Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2016Improved Approximations for Cubic Bipartite and Cubic TSP.
Anke van Zuylen
2016Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings
Quentin Louveaux, Martin Skutella
2016Intersection Cuts for Bilevel Optimization.
Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl
2016Max-Cut Under Graph Constraints.
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
2016Maximizing Monotone Submodular Functions over the Integer Lattice.
Tasuku Soma, Yuichi Yoshida
2016Minimal Cut-Generating Functions are Nearly Extreme.
Amitabh Basu, Robert Hildebrand, Marco Molinaro
2016On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming.
Alberto Del Pia
2016On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank.
Gérard Cornuéjols, Dabeen Lee
2016On the Mixed Binary Representability of Ellipsoidal Regions.
Alberto Del Pia, Jeffrey Poskin
2016On the Quantile Cut Closure of Chance-Constrained Problems.
Weijun Xie, Shabbir Ahmed
2016Popular Edges and Dominant Matchings.
Ágnes Cseh, Telikepalli Kavitha
2016Rescaled Coordinate Descent Methods for Linear Programming.
Daniel Dadush, László A. Végh, Giacomo Zambelli
2016Robust Monotone Submodular Function Maximization.
James B. Orlin, Andreas S. Schulz, Rajan Udwani
2016Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over.
Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
2016Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines.
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2016Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem.
Mourad Baïou, Francisco Barahona
2016Stabilizing Network Bargaining Games by Blocking Players.
Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità
2016Strong Reductions for Extended Formulations.
Gábor Braun, Sebastian Pokutta, Aurko Roy
2016Submodular Unsplittable Flow on Trees.
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
2016Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations.
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016Valid Inequalities for Separable Concave Constraints with Indicator Variables.
Cong Han Lim, Jeff T. Linderoth, James R. Luedtke
2016k-Trails: Recognition, Complexity, and Approximations.
Mohit Singh, Rico Zenklusen