default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 154
Volume 154, Numbers 1-2, December 2015
- Jon Lee, Jens Vygen:
Preface. 1-2 - Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. 3-28 - Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of trees for capacitated k-center. 29-53 - Alejandro Angulo Cardenas
, Daniel Espinoza, Rodrigo Palma:
Sequence independent lifting for mixed knapsack problems with GUB constraints. 55-80 - Gennadiy Averkov, Amitabh Basu:
Lifting properties of maximal lattice-free polyhedra. 81-111 - Manish Bansal, Kiavash Kianfar:
n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem. 113-144 - Nikhil Bansal, Viswanath Nagarajan:
On the adaptivity gap of stochastic orienteering. 145-172 - Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding small stabilizers for unstable graphs. 173-196 - Pierre Bonami, François Margot:
Cut generation through binarization. 197-223 - Amit Chakrabarti, Sagar Kale:
Submodular maximization meets streaming: matchings, matroids, and more. 225-247 - Chandra Chekuri, Alina Ene:
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. 249-272 - Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse split rank. 273-303 - José Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae:
Strong LP formulations for scheduling splittable jobs on unrelated machines. 305-328 - Santanu S. Dey, Marco Molinaro, Qianyi Wang:
Approximating polyhedra with sparse inequalities. 329-352 - Chien-Chung Huang, Telikepalli Kavitha:
Improved approximation algorithms for two variants of the stable marriage problem with ties. 353-380 - Volker Kaibel, Matthias Walter:
Simple extensions of polytopes. 381-406 - Volker Kaibel, Stefan Weltge:
Lower bounds on the sizes of integer programs without additional variables. 407-425 - Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson:
On the configuration LP for maximum budgeted allocation. 427-462 - Fatma Kilinç-Karzan, Sercan Yildiz:
Two-term disjunctions on the second-order cone. 463-491 - Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku:
Coupled and k-sided placements: generalizing generalized assignment. 493-514 - Lap Chi Lau, Hong Zhou:
A unified algorithm for degree bounded survivable network design. 515-532 - Matthias Mnich, Andreas Wiese:
Scheduling and fixed-parameter tractability. 533-562
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:18 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:
