default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25thIPCO 2024: Wrocław, Poland
- Jens Vygen, Jaroslaw Byrka:
Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024, Proceedings. Lecture Notes in Computer Science 14679, Springer 2024, ISBN 978-3-031-59834-0 - Iskander Aliev, Marcel Celaya, Martin Henk:
Sparsity and Integrality Gap Transference Bounds for Integer Programs. 1-13 - Aditya Anand, Euiwoong Lee
:
Separating k -sc Median from the Supplier Version. 14-27 - Jannis Blauth, Nathan Klein, Martin Nägele:
A Better-Than-1.6-Approximation for Prize-Collecting TSP. 28-42 - Marcel Celaya, Stefan Kuhlmann, Robert Weismantel:
On Matrices over a Polynomial Ring with Restricted Subdeterminants. 43-56 - Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh:
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. 57-70 - Gérard Cornuéjols, Siyue Liu, R. Ravi:
Approximately Packing Dijoins via Nowhere-Zero Flows. 71-84 - Rajni Dabas, Naveen Garg, Neelima Gupta:
Capacitated Facility Location with Outliers and Uniform Facility Costs. 85-98 - Jesús A. De Loera, Brittney Marsters, Luze Xu, Shixuan Zhang:
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones. 99-112 - Sally Dong, Thomas Rothvoss:
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. 113-123 - Théo Barré, Omar El Housni, Andrea Lodi:
Assortment Optimization with Visibility Constraints. 124-138 - Omar El Housni, Alfredo Torrico, Ulysse Hennebelle:
Adaptivity Gaps in Two-Sided Assortment Optimization. 139-153 - Yuri Faenza, Ayoub Foussoul, Chengyue He:
Two-Stage Stochastic Stable Matching. 154-167 - Yuri Faenza, Cliff Stein, Jia Wan:
Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory. 168-181 - Ayoub Foussoul, Vineet Goyal, Amit Kumar:
Fully-Dynamic Load Balancing. 182-195 - Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin:
Pairwise-Independent Contention Resolution. 196-209 - Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai:
An FPTAS for Connectivity Interdiction. 210-223 - Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. 224-237 - Billy Jin, Nathan Klein, David P. Williamson:
A Lower Bound for the Max Entropy Algorithm for TSP. 238-251 - Kirill Kukharenko, Laura Sanità:
On the Number of Degenerate Simplex Pivots. 252-264 - Yongchun Li, Weijun Xie:
On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms. 265-279 - Siyue Liu, Chao Xu:
On the Congruency-Constrained Matroid Base. 280-293 - Javier Marinkovic, José A. Soto, Victor Verdugo:
Online Combinatorial Assignment in Independence Systems. 294-308 - Jannik Matuschke:
Decomposing Probability Marginals Beyond Affine Requirements. 309-322 - Ryuhei Mizutani, Yuki Yoshida:
Polynomial Algorithms to Minimize 2/3-Submodular Functions. 323-336 - Meike Neuwohner:
A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs. 337-350 - Zeev Nutov:
Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. 351-364 - Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu:
Network Flow Problems with Electric Vehicles. 365-378 - Jamico Schade, Makrand Sinha, Stefan Weltge:
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. 379-392 - Emily Schutte, Matthias Walter:
Relaxation Strength for Multilinear Optimization: McCormick Strikes Back. 393-404 - Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida:
Online Algorithms for Spectral Hypergraph Sparsification. 405-417 - Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow:
Fast Combinatorial Algorithms for Efficient Sortation. 418-432 - Bart T. C. van Rossum, Rui Chen, Andrea Lodi:
A New Branching Rule for Range Minimization Problems. 433-445 - Diego Cifuentes, Santanu S. Dey, Jingye Xu:
Sensitivity Analysis for Mixed Binary Quadratic Programming. 446-459
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-12-12 01:19 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:
