Остановите войну!
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 29 matches
- 2019
- Maria Teresa Almeida, Raul Brás:
The maximum l-triangle k-club problem: Complexity, properties, and algorithms. Comput. Oper. Res. 111: 258-270 (2019) - Mualla Gonca Avci, Mustafa Avci:
An adaptive large neighborhood search approach for multiple traveling repairman problem with profits. Comput. Oper. Res. 111: 367-385 (2019) - Thomas Borthen, Henrik Loennechen, Kjetil Fagerholt, Xin Wang, Thibaut Vidal:
Bi-objective offshore supply vessel planning with costs and persistence objectives. Comput. Oper. Res. 111: 285-296 (2019) - Lu Chen, Yang Liu, André Langevin:
A multi-compartment vehicle routing problem in cold-chain distribution. Comput. Oper. Res. 111: 58-66 (2019) - Cihan Tugrul Cicek, Hakan Gultekin, Bülent Tavli:
The location-allocation problem of drone base stations. Comput. Oper. Res. 111: 155-176 (2019) - Georgios Dagkakis, Anna Rotondo, Cathal Heavey:
Embedding optimization with deterministic discrete event simulation for assignment of cross-trained operators: An assembly line case study. Comput. Oper. Res. 111: 99-115 (2019) - Ali Ekici, Milad Elyasi, Okan Örsan Özener, Merve Burcu Sarikaya:
An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics. Comput. Oper. Res. 111: 130-140 (2019) - Omar Foutlane, Issmail El Hallaoui, Pierre Hansen:
Integral simplex using double decomposition for set partitioning problems. Comput. Oper. Res. 111: 243-257 (2019) - Matthieu Gruson, Majid Bazrafshan, Jean-François Cordeau, Raf Jans:
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. Comput. Oper. Res. 111: 297-310 (2019) - Pablo Cristini Guedes, Denis Borenstein, Monize Sâmara Visentini, Olinto César Bassi de Araújo, Alberto Francisco Kummer Neto:
Vehicle scheduling problem with loss in bus ridership. Comput. Oper. Res. 111: 230-242 (2019) - Mostafa Khatami, Amir Salehipour, F. J. Hwang:
Makespan minimization for the m-machine ordered flow shop scheduling problem. Comput. Oper. Res. 111: 400-414 (2019) - Do Yeon Lee, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives. Comput. Oper. Res. 111: 141-154 (2019) - Yanchao Liu:
An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones. Comput. Oper. Res. 111: 1-20 (2019) - Peihai Liu, Manzhan Gu, Ganggang Li:
Two-agent scheduling on a single machine with release dates. Comput. Oper. Res. 111: 35-42 (2019) - Manuel Lozano, Humberto M. Trujillo:
Optimizing node infiltrations in complex networks by a local search based heuristic. Comput. Oper. Res. 111: 197-213 (2019) - Zhi Lu, Jin-Kao Hao, Yi Zhou:
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. Comput. Oper. Res. 111: 43-57 (2019) - Ana Flávia Uzeda dos Santos Macambira, Luidi Simonetti, Hugo Barbalho, Pedro Henrique González, Nelson Maculan:
A new formulation for the Safe Set problem on graphs. Comput. Oper. Res. 111: 346-356 (2019) - Amin Mallek, Mohamed Bendraouche, Mourad Boudhar:
Scheduling identical jobs on uniform machines with a conflict graph. Comput. Oper. Res. 111: 357-366 (2019) - Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Yufen Shao, Dimitri J. Papageorgiou:
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing. Comput. Oper. Res. 111: 21-34 (2019) - Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel:
Assignment problem with conflicts. Comput. Oper. Res. 111: 214-229 (2019) - Ali Haydar Özer:
A double auction based mathematical market model and heuristics for internet-based secondhand durable good markets. Comput. Oper. Res. 111: 116-129 (2019) - Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput. Oper. Res. 111: 177-196 (2019) - Guansheng Peng, Reginald Dewil, Cédric Verbeeck, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen:
Agile earth observation satellite scheduling: An orienteering problem with time-dependent profits and travel times. Comput. Oper. Res. 111: 84-98 (2019) - Santiago Sánchez-Herrera, Jairo R. Montoya-Torres, Elyn L. Solano-Charris:
Flow shop scheduling problem with position-dependent processing times. Comput. Oper. Res. 111: 325-345 (2019) - Eva Vallada, Fulgencia Villa, Luis Fanjul-Peyro:
Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem. Comput. Oper. Res. 111: 415-424 (2019) - Sainan Wang, Suixiang Gao, Tunzi Tan, Wenguo Yang:
Bunker fuel cost and freight revenue optimization for a single liner shipping service. Comput. Oper. Res. 111: 67-83 (2019) - Sanne Wøhlk, Gilbert Laporte:
A districting-based heuristic for the coordinated capacitated arc routing problem. Comput. Oper. Res. 111: 271-284 (2019) - Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi:
The clustered team orienteering problem. Comput. Oper. Res. 111: 386-399 (2019) - Carlos Armando Zetina, Iván A. Contreras, Jean-François Cordeau:
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design. Comput. Oper. Res. 111: 311-324 (2019)
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 12:20 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