default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26thIPCO 2025: Baltimore, MD, USA
- Nicole Megow
, Amitabh Basu:
Integer Programming and Combinatorial Optimization - 26th International Conference, IPCO 2025, Baltimore, MD, USA, June 11-13, 2025, Proceedings. Lecture Notes in Computer Science 15620, Springer 2025, ISBN 978-3-031-93111-6 - Ahmad Abdi, Gérard Cornuéjols, Siyue Liu, Olha Silina:
Strongly Connected Orientations and Integer Lattices. 1-14 - Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
Prize-Collecting Forest with Submodular Penalties: Improved Approximation. 15-28 - Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese:
On the Approximability of Unsplittable Flow on a Path with Time Windows. 29-42 - Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad, Mahya Jamshidian:
A Constant-Factor Approximation for Pairwise Fair k-Center Clustering. 43-57 - Ishan Bansal:
A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems. 58-71 - Richard Bi, Karthekeyan Chandrasekaran, Soham Joshi:
Monotone Submodular Multiway Partition. 72-85 - Alexander E. Black:
Exponential Lower Bounds for Many Pivot Rules for the Simplex Method. 86-99 - Sander Borst, Danish Kashaev, Zhuan Khye Koh:
Online Matching on 3-Uniform Hypergraphs. 100-113 - Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub:
On the Bidirected Cut Relaxation for Steiner Forest. 114-127 - Kristóf Bérczi, Vasilis Livanos, José A. Soto, Victor Verdugo:
Matroid Secretary via Labeling Schemes. 128-141 - Pascal Börner, Max Klimm, Annette Lutz, Marc E. Pfetsch, Martin Skutella, Lea Strubberg:
Valid Cuts for the Design of Potential-Based Flow Networks. 142-156 - Matteo Cacciola, Alexandre Forel, Antonio Frangioni, Andrea Lodi:
The Differentiable Feasibility Pump. 157-171 - Parinya Chalermsook, Chien-Chung Huang:
Approximate Cut & Packing Ratios for Multi-commodity Arborescences. 172-183 - Diego Cifuentes, Santanu S. Dey, Jingye Xu:
Lagrangian Dual for Integer Optimization with Zero Duality Gap that Admits Decomposition. 184-198 - Andrés Cristi, David Salas:
Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer Volume. 199-212 - Yann Disser, Nils Mosis:
An Unconditional Lower Bound for the Active-Set Method on the Hypercube. 213-227 - Christopher En, Yuri Faenza:
Non-distributive Lattices, Stable Matchings, and Linear Optimization. 228-241 - Yuval Filmus, Roy Schwartz, Alexander V. Smal:
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint. 242-255 - Christoph Grüne, Lasse Wulf:
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization. 256-269 - Venkatesan Guruswami, Hsin-Po Wang:
Semirandom Planted Clique via 1-Norm Isometry Property. 270-282 - Blake Harris, Viswanath Nagarajan, Rayen Tan:
Sequential Testing with Subadditive Costs. 283-296 - Christoph Hunkenschröder, Martin Koutecký, Asaf Levin, Tung Anh Vu:
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs. 297-311 - Sharat Ibrahimpur, László A. Végh:
An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding. 312-325 - Suho Kang, Ziyang Liu, Rajan Udwani:
A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation. 326-340 - Max Klimm, Martin Knaack:
Generalized Assignment and Knapsack Problems in the Random-Order Model. 341-354 - Stefan Kober:
Totally $\varDelta $-Modular IPs with Two Non-zeros in Most Rows. 355-370 - Stefan Kuhlmann, Timm Oertel, Robert Weismantel:
Sparse Approximation in Lattices and Semigroups. 371-384 - David Alemán-Espinosa, Nikhil Kumar:
Unsplittable Multicommodity Flows in Outerplanar Graphs. 385-399 - Jason Li, Owen Li:
A Simple and Fast Algorithm for Fair Cuts. 400-411 - Yongchun Li:
The Augmented Factorization Bound for Maximum-Entropy Sampling. 412-426 - Mohammed Majthoub Almoghrabi, Martin Skutella, Philipp Warode:
Integer and Unsplittable Multiflows in Series-Parallel Digraphs. 427-441 - Lars Rohwedder, Karol Wegrzycki:
Space-Efficient Algorithm for Integer Programming with Few Constraints. 442-451 - Rolf van der Hulst, Matthias Walter:
Implied Integrality in Mixed-Integer Optimization. 452-465
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-02-01 22:59 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:
