Остановите войну!
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 22 matches
- 2022
- Richard Allmendinger, Andrzej Jaszkiewicz, Arnaud Liefooghe, Christiane Tammer:
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization. Comput. Oper. Res. 145: 105857 (2022) - Asma Ben-Said, Aziz Moukrim, Rym Nesrine Guibadj, Jérôme Verny:
Using decomposition-based multi-objective algorithm to solve Selective Pickup and Delivery Problems with Time Windows. Comput. Oper. Res. 145: 105867 (2022) - Maria Elena Bruni, Sara Khodaparasti, Mohammad Moshref-Javadi:
A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones. Comput. Oper. Res. 145: 105845 (2022) - Erdi Dasdemir, Rajan Batta, Murat Köksalan, Diclehan Tezcaner Öztürk:
UAV routing for reconnaissance mission: A multi-objective orienteering problem with time-dependent prizes and multiple connections. Comput. Oper. Res. 145: 105882 (2022) - Nader Ghaffari-Nasab:
Stochastic hub location problems with Bernoulli demands. Comput. Oper. Res. 145: 105851 (2022) - Zhineng Hu, Li Wang, Jindong Qin, Benjamin Lev, Lu Gan:
Optimization of facility location and size problem based on bi-level multi-objective programming. Comput. Oper. Res. 145: 105860 (2022) - Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí:
Scatter search for the minimum leaf spanning tree problem. Comput. Oper. Res. 145: 105858 (2022) - Eun-Seok Kim, Ik Sun Lee:
Scheduling of two-machine flowshop with outsourcing lead-time. Comput. Oper. Res. 145: 105864 (2022) - Edward Lam, Guy Desaulniers, Peter J. Stuckey:
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations. Comput. Oper. Res. 145: 105870 (2022) - Hernán Lespay, Karol Suchan:
Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 145: 105866 (2022) - Michele Monaci, Ciara Pike-Burke, Alberto Santini:
Exact algorithms for the 0-1 Time-Bomb Knapsack Problem. Comput. Oper. Res. 145: 105848 (2022) - Bianca Pascariu, Marcella Sama, Paola Pellegrini, Andrea D'Ariano, Joaquin Rodriguez, Dario Pacciarelli:
Effective train routing selection for real-time traffic management: Improved model and ACO parallel computing. Comput. Oper. Res. 145: 105859 (2022) - Andrea Di Placido, Claudia Archetti, Carmine Cerrone:
A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance. Comput. Oper. Res. 145: 105831 (2022) - Bruno de Athayde Prata, Victor Fernandez-Viagas, Jose M. Framiñan, Carlos Diego Rodrigues:
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Comput. Oper. Res. 145: 105880 (2022) - Natanael Ramos, Pedro J. de Rezende, Cid C. de Souza:
Optimal area polygonization problems: Exact solutions through geometric duality. Comput. Oper. Res. 145: 105842 (2022) - Debdatta Sinha Roy, Christof Defryn, Bruce L. Golden, Edward A. Wasil:
Data-driven optimization and statistical modeling to improve meter reading for utility companies. Comput. Oper. Res. 145: 105844 (2022) - Luis Augusto San-José, Joaquín Sicilia, Valentín Pando, David Alcaide López de Pablo:
An inventory system with time-dependent demand and partial backordering under return on inventory investment maximization. Comput. Oper. Res. 145: 105861 (2022) - Ilia A. Tarasov, Alain Haït, Olga Battaïa:
Erratum to "Benders decomposition for a period-aggregated resource leveling problem with variable job duration" [Comput. Oper. Res. 132 (2021) 105258]. Comput. Oper. Res. 145: 105839 (2022) - Shijin Wang, Ying Lu, Feng Chu, Jianbo Yu:
Scheduling with divisible jobs and subcontracting option. Comput. Oper. Res. 145: 105850 (2022) - Sanne Wøhlk, Gilbert Laporte:
Transport of skips between recycling centers and treatment facilities. Comput. Oper. Res. 145: 105879 (2022) - Sicheng Zhang, Xiyuan Zhao, Xiang Li, Haitao Yu:
Heterogeneous fleet management for one-way electric carsharing system with optional orders, vehicle relocation and on-demand recharging. Comput. Oper. Res. 145: 105868 (2022) - Zilong Zhuang, Zhanluo Zhang, Hao Teng, Wei Qin, Huaijin Fang:
Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals. Comput. Oper. Res. 145: 105863 (2022)
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-06-03 11:00 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