default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24thIPCO 2023: Madison, WI, USA
- Alberto Del Pia
, Volker Kaibel:
Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings. Lecture Notes in Computer Science 13904, Springer 2023, ISBN 978-3-031-32725-4 - Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro:
Information Complexity of Mixed-Integer Convex Optimization. 1-13 - Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg:
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. 14-28 - Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev:
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. 29-43 - Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel:
Sparse Approximation over the Cube. 44-57 - Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. 58-71 - Jean Cardinal, Raphael Steiner:
Inapproximability of Shortest Paths on Perfect Matching Polytopes. 72-86 - Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano:
Monoidal Strengthening and Unique Lifting in MIQCPs. 87-99 - Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From Approximate to Exact Integer Programming. 100-114 - Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae:
Optimizing Low Dimensional Functions over the Integers. 115-126 - Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou:
Configuration Balancing for Stochastic Requests. 127-141 - Satoru Fujishige, Tomonari Kitahara, László A. Végh:
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. 142-156 - Matthew Gerstbrein, Laura Sanità, Lucy Verberk:
Stabilization of Capacitated Matching Games. 157-171 - Oussama Hanguir, Will Ma, Christopher Thomas Ryan:
Designing Optimization Problems with Diverse Solutions. 172-186 - Christoph Hertrich, Leon Sering:
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation. 187-202 - Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh:
On the Correlation Gap of Matroids. 203-216 - Billy Jin, Nathan Klein, David P. Williamson:
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. 217-230 - Michael Joswig, Max Klimm, Sylvain Spitz:
The Polyhedral Geometry of Truthful Auctions. 231-245 - Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling. 246-260 - Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP. 261-274 - Aleksandr M. Kazachkov, Egon Balas:
Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts. 275-290 - Yusuke Kobayashi:
Optimal General Factor Problem and Jump System Intersection. 291-305 - Jannik Matuschke:
Decomposition of Probability Marginals for Security Games in Abstract Networks. 306-318 - Nicole Megow, Jens Schlöter:
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. 319-333 - Gonzalo Muñoz, Joseph Paat, Felipe Serrano:
Towards a Characterization of Maximal Quadratic-Free Sets. 334-347 - Gonzalo Muñoz, Joseph Paat, Álinson S. Xavier:
Compressing Branch-and-Bound Trees. 348-362 - Gonzalo Muñoz, David Salas, Anton Svensson:
Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming. 363-377 - Pranav Nuti, Jan Vondrák:
Towards an Optimal Contention Resolution Scheme for Matchings. 378-392 - Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen:
Advances on Strictly $\varDelta $-Modular IPs. 393-407 - Joseph Poremba, F. Bruce Shepherd:
Cut-Sufficient Directed 2-Commodity Multiflow Topologies. 408-422 - Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. 423-437 - Noah Weninger, Ricardo Fukasawa:
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints. 438-452 - Da Wei Zheng, Monika Henzinger:
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. 453-465 - Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. 466-479
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 2024-10-31 20:22 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:
