default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 206
Volume 206, Number 1, July 2024
- Karen I. Aardal, Laura Sanità:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022. 1-2 - Markus Ahrens, Dorothee Henke
, Stefan Rabenstein, Jens Vygen:
Faster goal-oriented shortest path search for bulk and incremental detailed routing. 3-32 - Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
On the complexity of separating cutting planes for the knapsack polytope. 33-59 - Gennadiy Averkov, Matthias Schymura:
On the maximal number of columns of a Δ-modular integer matrix: bounds and computations. 61-89 - Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. 91-124 - Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total dual dyadicness and dyadic generating sets. 125-143 - Max Gläser, Marc E. Pfetsch:
On computing small variable disjunction branch-and-bound trees. 145-173 - Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan:
An abstract model for branch and cut. 175-202 - Alberto Del Pia, Matthias Walter:
Simple odd β-cycle inequalities for binary polynomial optimization. 203-238 - Omar El Housni, Ayoub Foussoul, Vineet Goyal:
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization. 239-281 - Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
A simple method for convex optimization in the oracle model. 283-304 - Eric Balkanski, Yuri Faenza, Mathieu Kubik:
The simultaneous semi-random model for TSP. 305-332 - Sammy Khalife, Hongyu Cheng, Amitabh Basu:
Neural networks with linear threshold activations: structure and algorithms. 333-356 - Rui Chen, James R. Luedtke:
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables. 357-388 - Meike Neuwohner:
The limits of local search for weighted k-set packing. 389-427 - José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg:
Optimal item pricing in online combinatorial auctions. 429-460 - Martin Drees:
Intersecting and dense restrictions of clutters in polynomial time. 461-477 - Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. 479-495 - Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A competitive algorithm for throughput maximization on identical machines. 497-514 - Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds. 515-539 - Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-based TSP rounding for half-integral solutions. 541-576 - Renee Mirka, Devin Smedira, David P. Williamson:
Graph coloring and semidefinite rank. 577-605 - Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the horizontal rectangle stabbing problem. 607-630 - Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
On circuit diameter bounds via circuit imbalances. 631-662
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-12-12 20:49 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:
