Остановите войну!
for scientists:
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 26 matches
- 2021
- Eduardo Álvarez-Miranda, Markus Sinnl:
Exact and heuristic algorithms for the weighted total domination problem. Comput. Oper. Res. 127: 105157 (2021) - Claudia Archetti, Francesca Guerriero, Giusy Macrina:
The online vehicle routing problem with occasional drivers. Comput. Oper. Res. 127: 105144 (2021) - Victor Bucarey, Sourour Elloumi, Martine Labbé, Fränk Plein:
Models and algorithms for the product pricing with single-minded customers requesting bundles. Comput. Oper. Res. 127: 105139 (2021) - Jian Chang, Lifang Wang, Jin-Kao Hao, Yang Wang:
Parallel iterative solution-based tabu search for the obnoxious p-median problem. Comput. Oper. Res. 127: 105155 (2021) - Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao:
Computing maximum k-defective cliques in massive graphs. Comput. Oper. Res. 127: 105131 (2021) - Nico P. Dellaert, Tom Van Woensel, Teodor Gabriel Crainic, Fardin Dashty Saridarq:
A multi-commodity two-Echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach. Comput. Oper. Res. 127: 105154 (2021) - Alexandre Frias Faria, Sérgio Ricardo de Souza, Elisangela Martins de Sá:
A mixed-integer linear programming model to solve the Multidimensional Multi-Way Number Partitioning Problem. Comput. Oper. Res. 127: 105133 (2021) - L. K. Hassan, Bruno Filipe Santos, Jeroen Vink:
Airline disruption management: A literature review and practical challenges. Comput. Oper. Res. 127: 105137 (2021) - Kun He, Kevin Tole, Fei Ni, Yong Yuan, Linyun Liao:
Adaptive large neighborhood search for solving the circle bin packing problem. Comput. Oper. Res. 127: 105140 (2021) - Hipólito Hernández-Pérez, Mercedes Landete, Inmaculada Rodríguez Martín:
The single-vehicle two-echelon one-commodity pickup and delivery problem. Comput. Oper. Res. 127: 105152 (2021) - Jully Jeunet, Federico Della Croce, Fabio Salassa:
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs. Comput. Oper. Res. 127: 105151 (2021) - Bin Ji, Dezhi Zhang, Samson S. Yu, Xiaoping Fang:
An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective. Comput. Oper. Res. 127: 105164 (2021) - Xiaowei Lin, Xiaoqiang Cai, Lianmin Zhang, Jing Zhou, Yinlian Zeng:
Revenue sharing for resource transfer among projects. Comput. Oper. Res. 127: 105156 (2021) - Carlo Mannino, Andreas Nakkerud, Giorgio Sartor:
Air traffic flow management with layered workload constraints. Comput. Oper. Res. 127: 105159 (2021) - Jordana Mecler, Anand Subramanian, Thibaut Vidal:
A simple and effective hybrid genetic search for the job sequencing and tool switching problem. Comput. Oper. Res. 127: 105153 (2021) - William Hitoshi Tsunoda Meira, Leandro Magatão, Flávio Neves Jr., Lúcia V. R. Arruda, Jonas P. Vaqueiro, Susana Relvas, Ana Barbosa-Póvoa:
A solution framework for the long-term scheduling and inventory management of straight pipeline systems with multiple-sources. Comput. Oper. Res. 127: 105143 (2021) - Lars Mönch, Liji Shen:
Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing. Comput. Oper. Res. 127: 105126 (2021) - Tobias Oelschlägel, Sigrid Knust:
Solution approaches for storage loading problems with stacking constraints. Comput. Oper. Res. 127: 105142 (2021) - Valentín Pando, Luis Augusto San-José, Joaquín Sicilia, David Alcaide López de Pablo:
Maximization of the return on inventory management expense in a system with price- and stock-dependent demand rate. Comput. Oper. Res. 127: 105134 (2021) - Javad Rezaei, Fatemeh Zare-Mirakabad, Seyyed Ali MirHassani, Sayed-Amir Marashi:
EIA-CNDP: An exact iterative algorithm for critical node detection problem. Comput. Oper. Res. 127: 105138 (2021) - Fabio Schoen, Luca Tigli:
Efficient large scale global optimization through clustering-based population methods. Comput. Oper. Res. 127: 105165 (2021) - Yang Woo Shin, Dug Hee Moon:
A unified approach for an approximation of tandem queues with failures and blocking under several types of service-failure interactions. Comput. Oper. Res. 127: 105161 (2021) - Sebastián A. Vásquez, Gustavo Angulo, Mathias A. Klapp:
An exact solution method for the TSP with Drone based on decomposition. Comput. Oper. Res. 127: 105127 (2021) - Tao Wu, Zhongshun Shi, Canrong Zhang:
The hub location problem with market selection. Comput. Oper. Res. 127: 105136 (2021) - Xinan Yang, Hajem A. Daham, Abdellah Salhi:
Combined strip and discharge delivery of containers in heterogeneous fleets with time windows. Comput. Oper. Res. 127: 105141 (2021) - Huimin Zhang, Shukai Li, Yanhui Wang, Yihui Wang, Lixing Yang:
Real-time optimization strategy for single-track high-speed train rescheduling with disturbance uncertainties: A scenario-based chance-constrained model predictive control approach. Comput. Oper. Res. 127: 105135 (2021)
loading more results
failed to load more results, please try again later
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-18 02: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