default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th IPCO 2019: Ann Arbor, MI, USA
- Andrea Lodi, Viswanath Nagarajan:
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings. Lecture Notes in Computer Science 11480, Springer 2019, ISBN 978-3-030-17952-6 - Ahmad Abdi
, Gérard Cornuéjols, Dabeen Lee:
Identically Self-blocking Clutters. 1-12 - Saba Ahmadi, Samir Khuller, Barna Saha:
Min-Max Correlation Clustering via MultiCut. 13-26 - Ross Anderson, Joey Huchette, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong Mixed-Integer Programming Formulations for Trained Neural Networks. 27-42 - Manuel Aprile, Yuri Faenza:
Extended Formulations from Communication Protocols in Output-Efficient Time. 43-56 - Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry. 57-71 - Daniel Bienstock, Chen Chen, Gonzalo Muñoz:
Intersection Cuts for Polynomial Optimization. 72-87 - Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie:
Fixed-Order Scheduling on Parallel Machines. 88-100 - Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. 101-114 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the Integrality Gap for Multiway Cut. 115-127 - Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
\ell _1 -sparsity Approximation Bounds for Packing Integer Programs. 128-140 - Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
A General Framework for Handling Commitment in Online Throughput Maximization. 141-154 - Federico Della Croce, Rosario Scatamacchia:
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints. 155-167 - Yann Disser, Alexander V. Hopp:
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule. 168-180 - Szymon Dudycz, Mateusz Lewandowski, Jan Marcinkowski:
Tight Approximation Ratio for Minimum Maximal Matching. 181-193 - Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. 194-204 - Elisabeth Gaar, Franz Rendl:
A Bundle Approach for SDPs with Exact Subgraph Constraints. 205-218 - Lukas Graf, Tobias Harks:
Dynamic Flows with Adaptive Route Choice. 219-232 - Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla:
The Markovian Price of Information. 233-246 - Robert Hildebrand, Matthias Köppe, Yuan Zhou:
On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem. 247-260 - Christoph Hunkenschröder, Gina Reuland, Matthias Schymura:
On Compact Representations of Voronoi Cells of Lattices. 261-274 - Zhuan Khye Koh, Laura Sanità:
An Efficient Characterization of Submodular Spanning Tree Games. 275-287 - Anna Köhne, Vera Traub, Jens Vygen:
The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. 288-298 - André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-matroid Intersection via Iterative Refinement. 299-312 - Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo:
An Exact Algorithm for Robust Influence Maximization. 313-326 - Martin Nägele, Rico Zenklusen:
A New Contraction Technique with Applications to Congruency-Constrained Cuts. 327-340 - Timm Oertel, Joseph Paat, Robert Weismantel:
Sparsity of Integer Solutions in the Average Case. 341-353 - Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
A Generic Exact Solver for Vehicle Routing and Related Problems. 354-369 - Miriam Schlöter:
Earliest Arrival Transshipments in Networks with Multiple Sinks. 370-384 - Felipe Serrano:
Intersection Cuts for Factorable MINLP. 385-398 - Ambros M. Gleixner, Daniel E. Steffy:
Linear Programming Using Limited-Precision Oracles. 399-412 - Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. 413-426 - Victor Verdugo, José Verschae:
Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. 427-441 - Ky Khac Vu, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Random Projections for Quadratic Programs over a Euclidean Ball. 442-452
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-03-07 22:50 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:
