![](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
- 2023
- Harry Aguilar
, Alberto García-Villoria, Rafael Pastor
:
Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times. Comput. Oper. Res. 157: 106285 (2023) - Claudio Arbib, Fabrizio Marinelli
, Ulrich Pferschy, Fatemeh K. Ranjbar
:
One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. 157: 106280 (2023) - Sally Giuseppe Arcidiacono, Salvatore Corrente, Salvatore Greco:
Scoring from pairwise winning indices. Comput. Oper. Res. 157: 106268 (2023) - Víctor Blanco
, Ricardo Gázquez
:
Fairness in maximal covering location problems. Comput. Oper. Res. 157: 106287 (2023) - Hongguang Bo, Xiao Alison Chen
, Qian Luo, Wenpeng Wang:
Manufacturing rescheduling after crisis or disaster-caused supply chain disruption. Comput. Oper. Res. 157: 106266 (2023) - Maurizio Bruglieri
, M. Paolucci, Ornella Pisacane:
A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model. Comput. Oper. Res. 157: 106261 (2023) - Maria Elena Bruni, Edoardo Fadda
, Stanislav Fedorov
, Guido Perboli
:
A machine learning optimization approach for last-mile delivery and third-party logistics. Comput. Oper. Res. 157: 106262 (2023) - Xianghua Chu, Shuxiang Li, Fei Gao, Can Cui
, Forest Pfeiffer, Jianshuang Cui:
A data-driven meta-learning recommendation model for multi-mode resource constrained project scheduling problem. Comput. Oper. Res. 157: 106290 (2023) - Tulay Flamand
, Manuel Iori
, Mohamed Haouari:
The transportation problem with packing constraints. Comput. Oper. Res. 157: 106278 (2023) - Mujin Gao, Yanru Chen
, Junheng Li, M. I. M. Wahab
:
Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows. Comput. Oper. Res. 157: 106267 (2023) - Daniele Giovanni Gioia
, Leonardo Kanashiro Felizardo
, Paolo Brandimarte
:
Simulation-based inventory management of perishable products via linear discrete choice models. Comput. Oper. Res. 157: 106270 (2023) - Mario Flores Gómez
, Valeria Borodin
, Stéphane Dauzère-Pérès
:
Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem. Comput. Oper. Res. 157: 106237 (2023) - Andy Oakey
, Antonio Martinez-Sykora
, Tom J. Cherrett
:
Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm. Comput. Oper. Res. 157: 106265 (2023) - Fabricio Alves Oliveira
, Elisangela Martins de Sá, Sérgio Ricardo de Souza
, Marcone Jamilson Freitas Souza
:
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation. Comput. Oper. Res. 157: 106252 (2023) - Guido Schryen
, Martina Sperling:
Literature reviews in operations research: A new taxonomy and a meta review. Comput. Oper. Res. 157: 106269 (2023) - Jakob Snauwaert
, Rob Van Eynde
, Mario Vanhoucke
:
On the complexity of efficient multi-skilled team composition. Comput. Oper. Res. 157: 106277 (2023) - Milena Vukicevic, Mustapha Ratli, Atika Rivenq, Maria Zrikem:
Covering delivery problem with electric vehicle and parcel lockers: Variable neighborhood search approach. Comput. Oper. Res. 157: 106263 (2023) - Lu Zhen
, Jingwen Wu
, Gilbert Laporte, Zheyi Tan:
Heterogeneous instant delivery orders scheduling and routing problem. Comput. Oper. Res. 157: 106246 (2023) - Jiongzhi Zheng, Jialun Zhong, Menglei Chen, Kun He
:
A reinforced hybrid genetic algorithm for the traveling salesman problem. Comput. Oper. Res. 157: 106249 (2023)
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-07-22 07:44 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