Остановите войну!
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 49 matches
- 2017
- Faezeh Akhavizadegan, Javad Ansarifar, Fariborz Jolai:
A novel approach to determine a tactical and operational decision for dynamic appointment scheduling at nuclear medical center. Comput. Oper. Res. 78: 267-277 (2017) - Juan A. Aledo, José A. Gámez, Alejandro Rosete:
Partial evaluation in Rank Aggregation Problems. Comput. Oper. Res. 78: 299-304 (2017) - Roberto Aringhieri, Maria Elena Bruni, Sara Khodaparasti, J. Theresia van Essen:
Emergency medical services and beyond: Addressing new challenges through a wide literature review. Comput. Oper. Res. 78: 349-368 (2017) - José Elías C. Arroyo, Joseph Y.-T. Leung:
Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Comput. Oper. Res. 78: 117-128 (2017) - Una Benlic, Edmund K. Burke, John R. Woodward:
Breakout local search for the multi-objective gate allocation problem. Comput. Oper. Res. 78: 80-93 (2017) - Ronan Bocquillon, Antoine Jouglet:
A constraint-programming-based approach for solving the data dissemination problem. Comput. Oper. Res. 78: 278-289 (2017) - Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi:
An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem. Comput. Oper. Res. 78: 513-525 (2017) - Thomas Breugem, Twan Dollevoet, Wilco van den Heuvel:
Analysis of FPTASes for the multi-objective shortest path problem. Comput. Oper. Res. 78: 44-58 (2017) - David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. Comput. Oper. Res. 78: 1-14 (2017) - Gilles Caporossi:
Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system. Comput. Oper. Res. 78: 431-438 (2017) - Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Manlio Gaudioso:
A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78: 163-171 (2017) - Emilio Carrizosa, Vanesa Guerrero, Dolores Romero Morales:
Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach. Comput. Oper. Res. 78: 369-380 (2017) - Vitor Nazário Coelho, Thays A. Oliveira, Igor Machado Coelho, Bruno N. Coelho, Peter J. Fleming, Frederico G. Guimarães, Helena Ramalhinho Dias Lourenço, Marcone J. F. Souza, El-Ghazali Talbi, Thibaut Lust:
Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign. Comput. Oper. Res. 78: 578-587 (2017) - Maxence Delorme, Manuel Iori, Silvano Martello:
Logic based Benders' decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78: 290-298 (2017) - Emir Demirovic, Nysret Musliu:
MaxSAT-based large neighborhood search for high school timetabling. Comput. Oper. Res. 78: 172-180 (2017) - Omar Dib, Marie-Ange Manier, Laurent Moalic, Alexandre Caminada:
Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks. Comput. Oper. Res. 78: 420-430 (2017) - Junwen Ding, Zhipeng Lü, Taoqing Zhou, Liping Xu:
A quality and distance guided hybrid algorithm for the vertex separator problem. Comput. Oper. Res. 78: 255-266 (2017) - Twan Dollevoet, Dennis Huisman, Leo G. Kroon, Lucas P. Veelenturf, Joris Camiel Wagenaar:
Application of an iterative framework for real-time railway rescheduling. Comput. Oper. Res. 78: 203-217 (2017) - Abraham Duarte, Nenad Mladenovic, Bassem Jarboui:
Special issue on Variable neighborhood search methods in business and engineering. Comput. Oper. Res. 78: 382-384 (2017) - Adil I. Erzin, Nenad Mladenovic, Roman V. Plotnikov:
Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78: 557-563 (2017) - José Fernández, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa, Aránzazu Gila Arrondo:
A planar single-facility competitive location and design problem under the multi-deterministic choice rule. Comput. Oper. Res. 78: 305-315 (2017) - Jose M. Framiñan, Paz Perez-Gonzalez:
New approximate algorithms for the customer order scheduling problem with total completion time objective. Comput. Oper. Res. 78: 181-192 (2017) - Boaz Golany, Noam Goldberg, Uriel G. Rothblum:
A two-resource allocation algorithm with an application to large-scale zero-sum defensive games. Comput. Oper. Res. 78: 218-229 (2017) - Sanja Grohmann, Dragan Urosevic, Emilio Carrizosa, Nenad Mladenovic:
Solving multifacility Huff location models on networks using metaheuristic and exact approaches. Comput. Oper. Res. 78: 537-546 (2017) - Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia:
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile. Comput. Oper. Res. 78: 27-43 (2017) - Erfan Hassannayebi, Seyed Hessameddin Zegordi:
Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem. Comput. Oper. Res. 78: 439-453 (2017) - Zhengwen He, Hua He, Renjing Liu, Nengmin Wang:
Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap. Comput. Oper. Res. 78: 564-577 (2017) - Jelke J. van Hoorn, Agustín Nogueira, Ignacio Ojea, Joaquim A. S. Gromicho:
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming. Comput. Oper. Res. 78: 381 (2017) - Chandra Ade Irawan, Dylan F. Jones, Djamila Ouelhadj:
Bi-objective optimisation model for installation scheduling in offshore wind farms. Comput. Oper. Res. 78: 393-407 (2017) - Martine Labbé, Diego Ponce, Justo Puerto:
A comparative study of formulations and solution methods for the discrete ordered p-median problem. Comput. Oper. Res. 78: 230-242 (2017)
skipping 19 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-27 09:40 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