default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st IPCO 2020: London, UK
- Daniel Bienstock, Giacomo Zambelli:
Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings. Lecture Notes in Computer Science 12125, Springer 2020, ISBN 978-3-030-45770-9 - Ahmad Abdi
, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise Intersecting Families. 1-12 - David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity. 13-26 - Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. 27-39 - Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel:
Optimizing Sparsity over Lattices and Semigroups. 40-51 - Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. 52-65 - Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight Approximation Bounds for Maximum Multi-coverage. 66-77 - Pierre Bonami, Domenico Salvagnin, Andrea Tramontani:
Implementing Automatic Benders Decomposition in a Modern MIP Solver. 78-90 - Thomas Bosman, Neil Olver:
Improved Approximation Algorithms for Inventory Problems. 91-103 - Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. 104-116 - Sanjeeb Dash, Oktay Günlük, Dabeen Lee:
On a Generalization of the Chvátal-Gomory Closure. 117-129 - Dario Frascaria, Neil Olver:
Algorithms for Flows over Time with Scheduling Costs. 130-143 - Naveen Garg, Nikhil Kumar, András Sebö:
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. 144-157 - Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). 158-170 - Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous Facility Location on Graphs. 171-181 - Cheolwon Heo, Bertrand Guenin:
Recognizing Even-Cycle and Even-Cut Matroids. 182-195 - Hiroshi Hirai, Yuni Iwamasa:
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 Submatrices. 196-208 - Xinrui Jia, Kshiteej Sheth, Ola Svensson:
Fair Colorful k-Center Clustering. 209-222 - Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. 223-237 - Csaba Király, András Mihálykó:
Sparse Graphs and an Augmentation Problem. 238-251 - Kim-Manuel Klein:
About the Complexity of Two-Stage Stochastic IPs. 252-265 - Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
Packing Under Convex Quadratic Constraints. 266-279 - Yusuke Kobayashi:
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles. 280-293 - Sarah Morell, Martin Skutella:
Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds. 294-306 - Gonzalo Muñoz, Felipe Serrano:
Maximal Quadratic-Free Sets. 307-321 - Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano:
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming. 322-337 - Joseph Paat, Miriam Schlöter, Robert Weismantel:
The Integrality Number of an Integer Program. 338-350 - Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge:
Persistency of Linear Programming Relaxations for the Stable Set Problem. 351-363 - Joseph Paat, Miriam Schlöter, Emily Speakman:
Constructing Lattice-Free Gradient Polyhedra in Dimension Two. 364-377 - Xueyu Shi, Oleg A. Prokopyev, Bo Zeng:
Sequence Independent Lifting for the Set of Submodular Maximization Problem. 378-390 - Vera Traub, Thorben Tröbst:
A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. 391-404 - Willem-Jan van Hoeve:
Graph Coloring Lower Bounds from Decision Diagrams. 405-418 - Alex L. Wang, Fatma Kilinç-Karzan:
On Convex Hulls of Epigraphs of QCQPs. 419-432 - Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables. 433-447
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-11-27 01:11 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:
