


default search action
Discrete Optimization, Volume 27
Volume 27, February 2018
- Pierre Le Bodic

, Jeffrey William Pavelka, Marc E. Pfetsch
, Sebastian Pokutta:
Solving MIPs via scaling-based augmentation. 1-25 - Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. 26-56 - Stefan Canzar

, Khaled M. Elbassioni
, Amr Elmasry, Rajiv Raman:
On the approximability of the maximum interval constrained coloring problem. 57-72 - Ante Custic, Ruonan Zhang, Abraham P. Punnen:

The quadratic minimum spanning tree problem and its variations. 73-87 - Michael Poss

:
Robust combinatorial optimization with knapsack uncertainty. 88-102 - Yu Hin (Gary) Au, Levent Tunçel

:
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. 103-129

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














