default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 28
Volume 28, May 2018
- Christoph Buchheim
, Jannis Kurtz:
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. 1-15 - Bostjan Bresar, Tim Kos, Graciela L. Nasini, Pablo Daniel Torres:
Total dominating sequences in trees, split graphs, and under modular decomposition. 16-30 - Nir Halman, Giacomo Nannicini, James B. Orlin:
On the complexity of energy storage problems. 31-53 - An Zhang, Yong Chen, Lin Chen, Guangting Chen:
On the NP-hardness of scheduling with time restrictions. 54-62 - Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-time recognition of map graphs with outerplanar witness. 63-77 - Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Discrete convexity in joint winner property. 78-88 - Thomas R. Stidsen, Kim Allan Andersen:
A hybrid approach for biobjective optimization. 89-114
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-04 01:28 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:
