default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 192
Volume 192, Number 1, March 2022
- Daniel Bienstock, Giacomo Zambelli
:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020. 1-2 - Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A technique for obtaining true approximations for k-center with covering constraints. 3-27 - Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise intersecting families. 29-50 - Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Correction to: Idealness of k-wise intersecting families. 51-55 - Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
Ideal formulations for constrained convex optimization problems with indicator variables. 57-88 - Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano:
On generalized surrogate duality in mixed-integer nonlinear programming. 89-118 - Csaba Király, András Mihálykó:
Sparse graphs and an augmentation problem. 119-148 - Sanjeeb Dash, Oktay Günlük, Dabeen Lee:
On a generalization of the Chvátal-Gomory closure. 149-175 - Dario Frascaria, Neil Olver:
Algorithms for flows over time with scheduling costs. 177-206 - Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous facility location on graphs. 207-227 - Gonzalo Muñoz, Felipe Serrano:
Maximal quadratic-free sets. 229-270 - Joseph Paat, Miriam Schlöter, Robert Weismantel:
The integrality number of an integer program. 271-291 - Joseph Paat, Miriam Schlöter, Emily Speakman:
Constructing lattice-free gradient polyhedra in dimension two. 293-317 - Kim-Manuel Klein:
About the complexity of two-stage stochastic IPs. 319-337 - Xinrui Jia, Kshiteej Sheth, Ola Svensson:
Fair colorful k-center clustering. 339-360 - Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
Packing under convex quadratic constraints. 361-386 - Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge:
Persistency of linear programming relaxations for the stable set problem. 387-407 - David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity. 409-441 - Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight approximation bounds for maximum multi-coverage. 443-476 - Sarah Morell, Martin Skutella:
Single source unsplittable flows with arc-wise lower and upper bounds. 477-496 - Vera Traub, Thorben Tröbst:
A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. 497-518 - Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel:
Sparse representation of vectors in lattices and semigroups. 519-546 - Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. 547-566 - Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular branchings and their dual certificates. 567-595 - Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
Stochastic makespan minimization in structured set systems. 597-630 - Willem-Jan van Hoeve:
Graph coloring with decision diagrams. 631-674 - Yusuke Kobayashi:
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. 675-702
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-11-29 00:07 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:
