default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 16
Volume 16, May 2015
- Nir Halman:
Approximating convex functions via non-convex oracles under the relative noise model. 1-16 - Agostinho Agra
, Mahdi Doostmohammadi, Quentin Louveaux:
Valid inequalities for the single arc design problem with set-ups. 17-35 - Sanjeeb Dash, Oktay Günlük, Marco Molinaro:
On the relative strength of different generalizations of split cuts. 36-50 - Boaz Farbstein, Asaf Levin:
Min-max cover of a graph with a small number of parts. 51-61 - Ahu Akdemir, Tínaz Ekim:
Advances on defective parameters in graphs. 62-69 - Cheng He, Hao Lin, Yixun Lin:
Bounded serial-batching scheduling for minimizing maximum lateness and makespan. 70-75 - Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
Local search inequalities. 76-89
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-12-09 00:13 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:
