Остановите войну!
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 173 matches
- 2011
- Pablo Adasme, Abdel Lisser, Ismael Soto:
Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme. Comput. Oper. Res. 38(10): 1377-1399 (2011) - Anurag Agarwal, Selçuk Çolak, S. Selçuk Erengüç:
A Neurogenetic approach for the resource-constrained project scheduling problem. Comput. Oper. Res. 38(1): 44-50 (2011) - Luis E. Agustín-Blas, Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Antonio Portilla-Figueras, Ángel M. Pérez-Bellido, Silvia Jiménez-Fernández:
Team formation based on group technology: A hybrid grouping genetic algorithm approach. Comput. Oper. Res. 38(2): 484-495 (2011) - Ibrahim Akgün:
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints. Comput. Oper. Res. 38(1): 277-286 (2011) - M. Selim Akturk, Taylan Ilhan:
Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness. Comput. Oper. Res. 38(4): 771-781 (2011) - Talal Al-Khamis, Rym M'Hallah:
A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity. Comput. Oper. Res. 38(12): 1747-1759 (2011) - Camelia Al-Najjar, Behnam Malakooti:
Hybrid-LP: Finding advanced starting points for simplex, and pivoting LP methods. Comput. Oper. Res. 38(2): 427-434 (2011) - Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. Comput. Oper. Res. 38(8): 1109-1116 (2011) - Enrico Angelelli, Renata Mansini, Michele Vindigni:
Look-ahead heuristics for the dynamic traveling purchaser problem. Comput. Oper. Res. 38(12): 1867-1876 (2011) - Davide Anghinolfi, Roberto Montemanni, Massimo Paolucci, Luca Maria Gambardella:
A hybrid particle swarm optimization approach for the sequential ordering problem. Comput. Oper. Res. 38(7): 1076-1085 (2011) - Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12): 1731-1746 (2011) - Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa:
Optimal solutions for the balanced minimum evolution problem. Comput. Oper. Res. 38(12): 1845-1854 (2011) - Vinícius Amaral Armentano, André Luís Shiguemoto, Arne Løkketangen:
Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38(8): 1199-1209 (2011) - Hasan Bal, H. Hasan Örkcü:
A new mathematical programming approach to multi-group classification problems. Comput. Oper. Res. 38(1): 105-111 (2011) - Francisco Ballestín, Rosa Blanco:
Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems. Comput. Oper. Res. 38(1): 51-62 (2011) - Santiago R. Balseiro, Irene Loiseau, J. Ramonet:
An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 38(6): 954-966 (2011) - June-Young Bang, Yeong-Dae Kim:
Scheduling algorithms for a semiconductor probing facility. Comput. Oper. Res. 38(3): 666-673 (2011) - Agustín Barrios, Francisco Ballestín, Vicente Valls:
A double genetic algorithm for the MRCPSP/max. Comput. Oper. Res. 38(1): 33-43 (2011) - José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
A Branch-and-Cut method for the Capacitated Location-Routing Problem. Comput. Oper. Res. 38(6): 931-941 (2011) - Lenys Bello, Rafael Blanquero, Emilio Carrizosa:
On minimax-regret Huff location models. Comput. Oper. Res. 38(1): 90-97 (2011) - Stefano Benati:
Heuristic methods for the optimal statistic median problem. Comput. Oper. Res. 38(1): 379-386 (2011) - Una Benlic, Jin-Kao Hao:
An effective multilevel tabu search approach for balanced graph partitioning. Comput. Oper. Res. 38(7): 1066-1075 (2011) - André Berger, Alexander Grigoriev, Joyce van Loon:
Price strategy implementation. Comput. Oper. Res. 38(2): 420-426 (2011) - Oded Berman, Eduard Ianovsky, Dmitry Krass:
Optimal search path for service in the presence of disruptions. Comput. Oper. Res. 38(11): 1562-1571 (2011) - Oded Berman, Dmitry Krass, Jiamin Wang:
The probabilistic gradual covering location problem on a network with discrete random demand weights. Comput. Oper. Res. 38(11): 1493-1500 (2011) - Edward Bernroider, Nikolaus Obwegeser, Volker Stix:
Analysis of heuristic validity, efficiency and applicability of the profile distance method for implementation in decision support systems. Comput. Oper. Res. 38(5): 816-823 (2011) - Lucio Bianco, Massimiliano Caramia:
A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations. Comput. Oper. Res. 38(1): 14-20 (2011) - Christian Blum, Cristóbal Miralles:
On solving the assembly line worker assignment and balancing problem via beam search. Comput. Oper. Res. 38(1): 328-339 (2011) - Victor Boskamp, Alex Knoops, Flavius Frasincar, Adriana Felicia Gabor:
Maximizing revenue with allocation of multiple advertisements on a Web banner. Comput. Oper. Res. 38(10): 1412-1424 (2011) - Radhouan Bouabda, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï:
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times. Comput. Oper. Res. 38(1): 387-393 (2011)
skipping 143 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 06:41 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