![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2019
- Rafael Kendy Arakaki
, Fábio Luiz Usberti:
An efficiency-based path-scanning heuristic for the capacitated arc routing problem. Comput. Oper. Res. 103: 288-295 (2019) - Tiziano Bacci
, Sara Mattia, Paolo Ventura:
The bounded beam search algorithm for the block relocation problem. Comput. Oper. Res. 103: 252-264 (2019) - Gulcin Bektur
, Tugba Saraç
:
A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Comput. Oper. Res. 103: 46-63 (2019) - Martin Bichler
, Salman Fadaei, Dennis Kraft:
A simple and fast algorithm for convex decomposition in relax-and-round mechanisms. Comput. Oper. Res. 103: 277-287 (2019) - Alexander Biele, Lars Mönch
:
Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines. Comput. Oper. Res. 103: 134-147 (2019) - Ulrich Breunig
, Roberto Baldacci
, Richard F. Hartl
, Thibaut Vidal:
The electric two-echelon vehicle routing problem. Comput. Oper. Res. 103: 198-210 (2019) - Maurizio Bruglieri, Simona Mancini
, Ferdinando Pezzella, Ornella Pisacane
:
A path-based solution approach for the Green Vehicle Routing Problem. Comput. Oper. Res. 103: 109-122 (2019) - Jeroen Burgelman, Mario Vanhoucke
:
Computing project makespan distributions: Markovian PERT networks revisited. Comput. Oper. Res. 103: 123-133 (2019) - Eduardo Conde
:
Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios. Comput. Oper. Res. 103: 97-108 (2019) - Claudio Contardo
, Manuel Iori, Raphael Kramer
:
A scalable exact algorithm for the vertex p-center problem. Comput. Oper. Res. 103: 211-220 (2019) - Junwen Ding
, Liji Shen, Zhipeng Lü, Bo Peng:
Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. Comput. Oper. Res. 103: 35-45 (2019) - Alessandro Galligari
, Marco Sciandrone:
A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand. Comput. Oper. Res. 103: 158-166 (2019) - Martin Hughes, Marc Goerigk
, Michael Wright:
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty. Comput. Oper. Res. 103: 64-80 (2019) - Armin Klausnitzer, Rainer Lasch:
Optimal facility layout and material handling network design. Comput. Oper. Res. 103: 237-251 (2019) - Mikhail Y. Kovalyov
, Dominik Kress
, Sebastian Meiswinkel, Erwin Pesch:
A parallel machine schedule updating game with compensations and clients averse to uncertain loss. Comput. Oper. Res. 103: 148-157 (2019) - Rhyd Lewis
, Dhananjay R. Thiruvady
, Kerri Morgan
:
Finding happiness: An analysis of the maximum happy vertices problem. Comput. Oper. Res. 103: 265-276 (2019) - Pieter Leyman
, Niels Van Driessche, Mario Vanhoucke
, Patrick De Causmaecker
:
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models. Comput. Oper. Res. 103: 184-197 (2019) - Karim Y. P. Martínez, Yossiri Adulyasak
, Raf Jans, Reinaldo Morabito
, Eli Angela V. Toso
:
An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem. Comput. Oper. Res. 103: 310-323 (2019) - Farzaneh Nasirian, Foad Mahdavi Pajouh
, Josephine M. Namayanja:
Exact algorithms for the minimum cost vertex blocker clique problem. Comput. Oper. Res. 103: 296-309 (2019) - José Niño-Mora
:
Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization. Comput. Oper. Res. 103: 221-236 (2019) - Diego Gabriel Rossit
, Daniele Vigo
, Fernando Tohmé, Mariano Frutos
:
Visual attractiveness in routing problems: A review. Comput. Oper. Res. 103: 13-34 (2019) - Oliver Strub
, Norbert Trautmann
:
A two-stage approach to the UCITS-constrained index-tracking problem. Comput. Oper. Res. 103: 167-183 (2019) - Dujuan Wang
, Jiaqi Zhu, Xiaowen Wei, T. C. E. Cheng
, Yunqiang Yin
, Yanzhang Wang:
Integrated production and multiple trips vehicle routing with time windows and uncertain travel times. Comput. Oper. Res. 103: 1-12 (2019) - Zhenzhen Zhang
, Brenda Cheang, Chongshou Li
, Andrew Lim
:
Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer. Comput. Oper. Res. 103: 81-96 (2019)
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-27 07:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint