default search action
22nd IPCO 2021: Atlanta, GA, USA
- Mohit Singh, David P. Williamson
:
Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings. Lecture Notes in Computer Science 12707, Springer 2021, ISBN 978-3-030-73878-5 - Jannis Blauth, Vera Traub
Improving the Approximation Ratio for Capacitated Vehicle Routing. 1-14 - Niv Buchbinder, Christian Coester
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. 15-29 - Siad Daboul, Stephan Held, Jens Vygen:
Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. 30-42 - Lucas Slot, Monique Laurent
Sum-of-Squares Hierarchies for Binary Polynomial Optimization. 43-57 - Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
Complexity, Exactness, and Rationality in Polynomial Optimization. 58-72 - José Verschae
On the Geometry of Symmetry Breaking Inequalities. 73-88 - Yuri Faenza, Xuan Zhang:
Affinely Representable Lattices, Stable Matchings, and Choice Functions. 89-103 - Lukas Graf
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. 104-118 - Yuni Iwamasa
A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices. 119-133 - Antonia Chmiela
On the Implementation and Strengthening of Intersection Cuts for QCQPs. 134-147 - Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard
Lifting Convex Inequalities for Bipartite Bilinear Programs. 148-162 - Leon Eifler
A Computational Status Update for Exact Rational Mixed Integer Programming. 163-177 - Vinícius Loti de Lima
New Exact Techniques Applied to a Class of Network Flow Formulations. 178-192 - Alberto Del Pia
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. 193-207 - Paritosh Garg, Linus Jordan, Ola Svensson:
Semi-streaming Algorithms for Submodular Matroid Intersection. 208-222 - Kazuki Matoya, Taihei Oki:
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. 223-237 - Christoph Glanzer, Ingo Stallknecht, Robert Weismantel:
On the Recognition of a, b, c-Modular Matrices. 238-251 - Omar El Housni, Vineet Goyal, David B. Shmoys:
On the Power of Static Assignment Policies for Robust Facility Location Problems. 252-267 - Deeparnab Chakrabarty, Maryam Negahbani:
Robust k-Center with Two Types of Radii. 268-282 - Franziska Eberle, Ruben Hoeksma
Speed-Robust Scheduling - Sand, Bricks, and Rocks. 283-296 - Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. 297-310 - Giacomo Nannicini:
Fast Quantum Subroutines for the Simplex Method. 311-325 - Guyslain Naves
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. 326-339 - Manuel Aprile
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. 340-353 - Karthekeyan Chandrasekaran, Weihang Wang:
Fixed Parameter Approximation Scheme for Min-Max k-Cut. 354-367 - Gennadiy Averkov
Computational Aspects of Relaxation Complexity. 368-382 - Amitabh Basu
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. 383-398 - Matthias Walter:
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs. 399-412 - Marcel Celaya, Martin Henk:
Proximity Bounds for Random Integer Programs. 413-426 - Sander Borst
On the Integrality Gap of Binary Integer Programs with Gaussian Data. 427-442 - Rahul Mazumder
Linear Regression with Mismatched Data: A Provably Optimal Local Search Algorithm. 443-457 - Robert D. Carr, Neil Simonetti
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem. 458-472 - Daniel Rehfeldt
Implications, Conflicts, and Reductions for Steiner Trees. 473-487
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 2024-12-15 01:15 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: