Остановите войну!
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 32 matches
- 2023
- Levi Ribeiro de Abreu, Bruno A. Prata, Marcelo Seido Nagano, Jose M. Framiñan:
A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization. Comput. Oper. Res. 160: 106386 (2023) - Silvia Baldassarre, Giuseppe Bruno, Antonio Diglio, Carmela Piccolo:
A sample approximation solution procedure for chance-constrained districting problems. Comput. Oper. Res. 160: 106376 (2023) - Simon Belieres, Yossiri Adulyasak, Jean-François Cordeau:
Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: An application to an automated kitchen. Comput. Oper. Res. 160: 106387 (2023) - Rafael Blanquero, Emilio Carrizosa, Boglárka G.-Tóth, Kristóf Kovács:
Solving the 1-median problem on a network with continuous demand and demand surplus. Comput. Oper. Res. 160: 106399 (2023) - Merve Bodur, Mucahit Cevik, André A. Ciré, Mark Ruschin, Juyoung Wang:
Multistage stochastic fractionated intensity modulated radiation therapy planning. Comput. Oper. Res. 160: 106371 (2023) - W. Eric Brown, Erick Moreno-Centeno:
A data mining transmission switching heuristic for post-contingency AC power flow violation reduction in real-world, large-scale systems. Comput. Oper. Res. 160: 106391 (2023) - Sifan Cai, Jie Deng, Loo Hay Lee, Ek Peng Chew, Haobin Li:
Heuristics for the two-dimensional irregular bin packing problem with limited rotations. Comput. Oper. Res. 160: 106398 (2023) - Zhongxiang Chang, Abraham P. Punnen, Zhongbao Zhou, Shi Cheng:
Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm. Comput. Oper. Res. 160: 106388 (2023) - Renaud Chicoisne, Fernando Ordóñez:
Algorithms for a risk-averse Stackelberg game with multiple adversaries. Comput. Oper. Res. 160: 106367 (2023) - Quang-Vinh Dang, Koen Herps, Tugce G. Martagan, Ivo Adan, Jasper Heinrich:
Unsupervised parallel machines scheduling with tool switches. Comput. Oper. Res. 160: 106361 (2023) - Kiera W. Dobbs, Douglas M. King, Sheldon H. Jacobson:
Redistricting optimization with recombination: A local search case study. Comput. Oper. Res. 160: 106369 (2023) - Cristiane Ferreira, Gonçalo Figueira, Pedro Amorim, Alexandre Pigatti:
Scheduling wagons to unload in bulk cargo ports with uncertain processing times. Comput. Oper. Res. 160: 106364 (2023) - Vera Fischer, Sanne Wøhlk:
A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation. Comput. Oper. Res. 160: 106393 (2023) - Donatella Granata, Antonino Sgalambro:
A hybrid modified-NSGA-II VNS algorithm for the Multi-Objective Critical Disruption Path Problem. Comput. Oper. Res. 160: 106363 (2023) - Sadeque Hamdan, Ali Cheaitou, Amir Shikhli, Imad Alsyouf:
Comprehensive quantity discount model for dynamic green supplier selection and order allocation. Comput. Oper. Res. 160: 106372 (2023) - Mitchell G. Harris, Michael A. Forbes, Thomas Taimre:
Logic-based benders decomposition for wildfire suppression. Comput. Oper. Res. 160: 106392 (2023) - Baybars Ibroska, Selin Özpeynirci, Özgür Özpeynirci:
Multiple traveling salesperson problem with drones: General variable neighborhood search approach. Comput. Oper. Res. 160: 106390 (2023) - Seulgi Joung:
Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees. Comput. Oper. Res. 160: 106374 (2023) - Ramin Talebi Khameneh, Milad Elyasi, Okan Örsan Özener, Ali Ekici:
A non-clustered approach to platelet collection routing problem. Comput. Oper. Res. 160: 106366 (2023) - Farnaz Khoshgehbari, S. Mohammad J. Mirzapour Al-e-Hashem:
Ambulance location routing problem considering all sources of uncertainty: Progressive estimating algorithm. Comput. Oper. Res. 160: 106400 (2023) - Byeongmok Kim, Ho Young Jeong, Seokcheon Lee:
Two-echelon collaborative routing problem with heterogeneous crowd-shippers. Comput. Oper. Res. 160: 106389 (2023) - Xiaolong Li, Yang Yu, Wei Sun, Jiafu Tang:
Reducing tardy batches by seru production: Model, exact solution, cooperative coevolution solution, and insights. Comput. Oper. Res. 160: 106048 (2023) - Zhipeng Lü, Yuan Fang, Zhouxing Su, Yang Wang, Xinyun Wu, Fred W. Glover:
Dual-neighborhood iterated local search for routing and wavelength assignment. Comput. Oper. Res. 160: 106396 (2023) - Hossein Moosaei, Milan Hladík, Mohamad Razzaghi, Saeed Ketabchi:
Newton-based approach to solving K-SVCR and Twin-KSVC multi-class classification in the primal space. Comput. Oper. Res. 160: 106370 (2023) - Çelen Naz Ötken, Baris Yildiz, Okan Arslan, Gilbert Laporte:
Making opportunity sales in attended home delivery. Comput. Oper. Res. 160: 106362 (2023) - Zhiyuan Ouyang, Eric K. H. Leung, Yiji Cai, George Q. Huang:
Dynamic community partitioning for e-commerce last mile delivery with time window constraints. Comput. Oper. Res. 160: 106394 (2023) - Mariam Sangaré, Eric Bourreau, Bernard Fortz, Amaury Pachurka, Michael Poss:
Loads scheduling for demand response in energy communities. Comput. Oper. Res. 160: 106358 (2023) - Rick S. H. Willemsen, Wilco van den Heuvel, Michel van de Velden:
A new mixed integer programming approach for inverse correspondence analysis. Comput. Oper. Res. 160: 106375 (2023) - Xinquan Wu, Xuefeng Yan:
A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem. Comput. Oper. Res. 160: 106401 (2023) - Ala-Eddine Yahiaoui, Sohaib Afifi, Hamid Allaoui:
Enhanced iterated local search for the technician routing and scheduling problem. Comput. Oper. Res. 160: 106385 (2023)
skipping 2 more matches
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-05-12 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