![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.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 23 matches
- 2024
- Saeedeh Ahmadi Basir, Güvenç Sahin, Gizem Ozbaygin:
A comparative study of alternative formulations for the periodic vehicle routing problem. Comput. Oper. Res. 165: 106583 (2024) - Claudia Bongiovanni, Nikolas Geroliminis, Mor Kaspi:
A ride time-oriented scheduling algorithm for dial-a-ride problems. Comput. Oper. Res. 165: 106588 (2024) - Guilherme Oliveira Chagas, Luiz Antonio Nogueira Lorena, Rafael Duarte Coelho dos Santos, Jacques Renaud, Leandro C. Coelho:
A parallel variable neighborhood search for α-neighbor facility location problems. Comput. Oper. Res. 165: 106589 (2024) - Jens Vinther Clausen, Yves Crama, Richard Lusby, Elisabeth Rodríguez-Heck, Stefan Ropke:
Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences. Comput. Oper. Res. 165: 106586 (2024) - Shakiba Enayati, Osman Y. Özaltin:
Supplier selection under disruption risk with hybrid procurement. Comput. Oper. Res. 165: 106593 (2024) - Saeedeh Hashemi, Mohammad Ranjbar:
Optimal resource allocation and routing in robotic mobile fulfillment systems. Comput. Oper. Res. 165: 106571 (2024) - Alexandre Heintzmann, Christian Artigues, Pascale Bendotti, Sandra Ulrich Ngueveu, Cécile Rottner:
A comparison of alternative models for solving a non-linear single plant Hydro Unit Commitment problem. Comput. Oper. Res. 165: 106591 (2024) - Junko Hosoda, Stephen J. Maher, Yuji Shinano, Jonas Christoffer Villumsen:
A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network. Comput. Oper. Res. 165: 106570 (2024) - Jie Hu, Tianqi Liu, Zhi Chen, Shuming Wang:
Optimal-transport satisficing with applications to capacitated hub location. Comput. Oper. Res. 165: 106566 (2024) - Christina J. Liepold, Okan Arslan, Gilbert Laporte, Maximilian Schiffer:
The Impact of Partial Production Capacity Sharing via Production as a Service. Comput. Oper. Res. 165: 106587 (2024) - Zhaofang Mao, Yiting Sun, Kan Fang, Dian Huang, Jiaxin Zhang:
Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem. Comput. Oper. Res. 165: 106605 (2024) - Kati Moug, Siqian Shen:
The costs of overcrowding (and release): Strategic discharges for isolated facilities during epidemiological outbreaks. Comput. Oper. Res. 165: 106578 (2024) - Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi:
An improved column-generation-based matheuristic for learning classification trees. Comput. Oper. Res. 165: 106579 (2024) - Marcelo Pinto, Cristóvão Silva, Matthias Thürer, Samuel Moniz:
Nesting and scheduling optimization of additive manufacturing systems: Mapping the territory. Comput. Oper. Res. 165: 106592 (2024) - Vadim V. Romanuke:
Deep clustering of the traveling salesman problem to parallelize its solution. Comput. Oper. Res. 165: 106548 (2024) - Marduch Tadaros, Angelo Sifaleras, Athanasios Migdalas:
A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles. Comput. Oper. Res. 165: 106594 (2024) - Mario Vanhoucke, José Coelho:
Reducing the feasible solution space of resource-constrained project instances. Comput. Oper. Res. 165: 106567 (2024) - Gongshu Wang, Jing Wu, Yang Yang, Lijie Su:
Robust optimization for a steel production planning problem with uncertain demand and product substitution. Comput. Oper. Res. 165: 106569 (2024) - Yoran R. de Weert, Konstantinos Gkiotsalitis, Eric C. Van Berkum:
Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators. Comput. Oper. Res. 165: 106580 (2024) - Javier Yuste, Eduardo G. Pardo, Abraham Duarte:
General Variable Neighborhood Search for the optimization of software quality. Comput. Oper. Res. 165: 106584 (2024) - Haipei Zang, Jinfu Zhu, Qi Zhu, Qiang Gao:
A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination. Comput. Oper. Res. 165: 106599 (2024) - Qian Zhang, Zheyi Tan, Shuaian Wang, Lu Zhen:
Shore hydrogen deployment problem in green ports. Comput. Oper. Res. 165: 106585 (2024) - Lu Zhen, Xueting He, Nianzu Zhang, Zhiyuan Yang, Yiran Ren:
Optimizing high-speed railway express system under uncertainty. Comput. Oper. Res. 165: 106565 (2024)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.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-07-28 05:21 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