default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rdIPCO 2022: Eindhoven, The Netherlands
- Karen I. Aardal
, Laura Sanità:
Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Lecture Notes in Computer Science 13265, Springer 2022, ISBN 978-3-031-06900-0 - Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total Dual Dyadicness and Dyadic Generating Sets. 1-14 - Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen:
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. 15-28 - Gennadiy Averkov, Matthias Schymura:
On the Maximal Number of Columns of a $\varDelta $-modular Matrix. 29-42 - Eric Balkanski, Yuri Faenza, Mathieu Kubik:
The Simultaneous Semi-random Model for TSP. 43-56 - Étienne Bamas, Marina Drygala, Ola Svensson:
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. 57-69 - Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai:
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. 70-83 - Marcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel:
Improving the Cook et al. Proximity Bound Given Integral Valued Constraints. 84-97 - Rui Chen, James R. Luedtke:
Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables. 98-111 - Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. 112-125 - José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg:
Optimal Item Pricing in Online Combinatorial Auctions. 126-139 - Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
On Circuit Diameter Bounds via Circuit Imbalances. 140-153 - Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
A Simple Method for Convex Optimization in the Oracle Model. 154-167 - Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
On the Complexity of Separation from the Knapsack Polytope. 168-180 - Alberto Del Pia, Matthias Walter:
Simple Odd β-Cycle Inequalities for Binary Polynomial Optimization. 181-194 - Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. 195-209 - Martin Drees:
Intersecting and Dense Restrictions of Clutters in Polynomial Time. 210-222 - Omar El Housni, Ayoub Foussoul, Vineet Goyal:
LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization. 223-236 - Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. 237-250 - Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. 251-261 - Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. 262-276 - Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan:
Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. 277-290 - Max Gläser, Marc E. Pfetsch:
On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. 291-304 - Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-Based TSP Rounding for Half-Integral Solutions. 305-318 - Samuel C. Gutekunst, Billy Jin, David P. Williamson:
The Two-Stripe Symmetric Circulant TSP is in P. 319-332 - Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan:
An Abstract Model for Branch-and-Cut. 333-346 - Sammy Khalife, Amitabh Basu:
Neural Networks with Linear Threshold Activations: Structure and Algorithms. 347-360 - Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the Horizontal Rectangle Stabbing Problem. 361-374 - Lukas Mayrhofer, Jamico Schade, Stefan Weltge:
Lattice-Free Simplices with Lattice Width 2d - o(d). 375-386 - Renee Mirka, Devin Smedira, David P. Williamson:
Graph Coloring and Semidefinite Rank. 387-401 - Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A Competitive Algorithm for Throughput Maximization on Identical Machines. 402-414 - Meike Neuwohner:
The Limits of Local Search for Weighted k-Set Packing. 415-428 - Pranav Nuti:
The Secretary Problem with Distributions. 429-439 - Thomas Rothvoss, Moritz Venzin:
Approximate $\mathrm {CVP}_{}$ in Time 20.802 n - Now in Any Norm! 440-453
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:
