default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 45
Volume 45, August 2022
- Cheng He, Jing Wu, Hao Lin:
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan. 100698 - Torbjörn Larsson
, Nils-Hassan Quttineh:
A theoretical justification of the set covering greedy heuristic of Caprara et al. 100700 - Romain Chapoullié, Zoltán Szigeti:
On packing time-respecting arborescences. 100702 - Mauro Henrique Mulati, Ricardo Fukasawa, Flávio Keidi Miyazawa:
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem. 100710 - Sapna Grover, Neelima Gupta, Samir Khuller:
LP-based approximation for uniform capacitated facility location problem. 100723 - Rebekah Herrman, Stephen G. Z. Smith:
On the length of L-Grundy sequences. 100725 - Dursun A. Bulutoglu:
Finding the dimension of a non-empty orthogonal array polytope. 100727 - Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On the analysis of optimization problems in arc-dependent networks. 100729
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-03-11 19:51 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:
翻译：