Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 172
Volume 172, Numbers 1-2, November 2018
- Quentin Louveaux, Martin Skutella:
Preface. 1-2 - Alberto Del Pia
:
On approximation algorithms for concave mixed-integer quadratic programming. 3-16 - André Linhares, Chaitanya Swamy:
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. 17-34 - Xiangkun Shen, Jon Lee, Viswanath Nagarajan:
Approximating graph-constrained max-cut. 35-58 - Mourad Baïou, Francisco Barahona:
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. 59-75 - Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
On the use of intersection cuts for bilevel optimization. 77-103 - Thai Dinh, Ricardo Fukasawa, James R. Luedtke:
Exact algorithms for the chance-constrained vehicle routing problem. 105-138 - Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma:
Polyhedral approximation in mixed-integer convex optimization. 139-168 - Mohit Singh, Rico Zenklusen:
k-Trails: recognition, complexity, and approximations. 169-189 - Corinna Gottschalk, Jens Vygen:
Better s-t-tours by Gao trees. 191-207 - Ágnes Cseh, Telikepalli Kavitha:
Popular edges and dominant matchings. 209-229 - Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and linear programming integrality gaps for scheduling identical machines. 231-248 - Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità:
Stabilizing network bargaining games by blocking players. 249-275 - Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma:
Round-robin tournaments generated by the Circle Method have maximum carry-over. 277-302 - Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme functions with an arbitrary number of slopes. 303-327 - Amitabh Basu, Robert Hildebrand, Marco Molinaro:
Minimal cut-generating functions are nearly extreme. 329-349 - Alberto Del Pia, Jeffrey Poskin:
Ellipsoidal mixed-integer representability. 351-369 - Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant factor approximation for ATSP with two edge weights. 371-397 - Anke van Zuylen:
Improved approximations for cubic bipartite and cubic TSP. 399-413 - Cong Han Lim, Jeff T. Linderoth, James R. Luedtke:
Valid inequalities for separable concave constraints with indicator variables. 415-442 - Alfredo Torrico, Shabbir Ahmed, Alejandro Toriello:
A polyhedral approach to online bipartite matching. 443-465 - Gérard Cornuéjols, Dabeen Lee:
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank. 467-503 - James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust monotone submodular function maximization. 505-537 - Tasuku Soma, Yuichi Yoshida:
Maximizing monotone submodular functions over the integer lattice. 539-563 - Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese:
Submodular unsplittable flow on trees. 565-589 - Gábor Braun, Sebastian Pokutta, Aurko Roy:
Strong reductions for extended formulations. 591-620 - Weijun Xie, Shabbir Ahmed:
On quantile cuts and their closure for chance constrained optimization problems. 621-646
a service of 
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-06-29 00:38 CEST 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:
