![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 19 matches
- 2021
- Mirko Alicastro, Daniele Ferone, Paola Festa, Serena Fugaro
, Tommaso Pastore
:
A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Comput. Oper. Res. 131: 105272 (2021) - Somayeh Allahyari, Saeed Yaghoubi
, Tom Van Woensel:
The secure time-dependent vehicle routing problem with uncertain demands. Comput. Oper. Res. 131: 105253 (2021) - Glory Uche Alozie, Ashwin Arulselvan, Kerem Akartunali
, Eduardo L. Pasiliao Jr.:
Efficient methods for the distance-based critical node detection problem in complex networks. Comput. Oper. Res. 131: 105254 (2021) - Tarik Aouam
, Foad Ghadimi, Mario Vanhoucke:
Finite inventory budgets in production capacity and safety stock placement under the guaranteed service approach. Comput. Oper. Res. 131: 105266 (2021) - Hatice Çalik
, Ammar Oulamara, Caroline Prodhon, Saïd Salhi:
The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach. Comput. Oper. Res. 131: 105251 (2021) - Gary Yu-Hsin Chen:
New variable-length data compression scheme for solution representation of meta-heuristics. Comput. Oper. Res. 131: 105256 (2021) - Emrah Demir, Daniel Eyers, Yuan Huang:
Competing through the last mile: Strategic 3D printing in a city logistics context. Comput. Oper. Res. 131: 105248 (2021) - Yi Ding, Yi Jiang, Liangping Wu, Zhanbo Zhou:
Two-echelon supply chain network design with trade credit. Comput. Oper. Res. 131: 105270 (2021) - Diego Jacinto Fiorotto, Raf Jans, Silvio Alexandre de Araujo:
Integrated lot sizing and blending problems. Comput. Oper. Res. 131: 105255 (2021) - Steven A. Gabriel, Marina Leal
, Martin Schmidt:
Solving binary-constrained mixed complementarity problems using continuous reformulations. Comput. Oper. Res. 131: 105208 (2021) - Salim Haddadi
:
Iterated local search for consecutive block minimization. Comput. Oper. Res. 131: 105273 (2021) - Zixiang Li
, Ibrahim Kucukkoc, Qiuhua Tang:
Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem. Comput. Oper. Res. 131: 105235 (2021) - Chunling Luo
, Lei Xu
:
Railway disruption management: Designing bus bridging services under uncertainty. Comput. Oper. Res. 131: 105284 (2021) - Sebastian Malicki, Stefan Minner:
Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands. Comput. Oper. Res. 131: 105247 (2021) - Mahsa Mohammadi, Shahrooz Shahparvari, Hamed Soleimani:
Multi-modal cargo logistics distribution problem: Decomposition of the stochastic risk-averse models. Comput. Oper. Res. 131: 105280 (2021) - Cristobal Pais, Jaime Carrasco
, Pelagie Elimbi Moudio, Zuo-Jun Max Shen
:
Downstream protection value: Detecting critical zones for effective fuel-treatment under wildfire risk. Comput. Oper. Res. 131: 105252 (2021) - Wei Qin, Zilong Zhuang, Yaoming Zhou
, Yinbin Sun:
Dynamic dispatching for interbay automated material handling with lot targeting using improved parallel multiple-objective genetic algorithm. Comput. Oper. Res. 131: 105264 (2021) - Simen T. Vadseth, Henrik Andersson
, Magnus Stålhane:
An iterative matheuristic for the inventory routing problem. Comput. Oper. Res. 131: 105262 (2021) - Luping Zhang, Chunxia Yu, T. N. Wong:
A graph-based constraint programming approach for the integrated process planning and scheduling problem. Comput. Oper. Res. 131: 105282 (2021)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-08-31 07:50 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