IPCO B

34 papers

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