Остановите войну!
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 208 matches
- 2006
- Roselyn Abbiw-Jackson, Bruce L. Golden, S. Raghavan, Edward A. Wasil:
A divide-and-conquer local search heuristic for data visualization. Comput. Oper. Res. 33(11): 3070-3087 (2006) - Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan:
Scheduling two parallel machines with a single server: the general case. Comput. Oper. Res. 33: 994-1009 (2006) - Walid Abdul-Kader:
Capacity improvement of an unreliable production line - an analytical approach. Comput. Oper. Res. 33: 1695-1712 (2006) - Dino Ahr, Gerhard Reinelt:
A tabu search algorithm for the min-max k-Chinese postman problem. Comput. Oper. Res. 33(12): 3403-3422 (2006) - Md. Mostofa Akbar, Mohammad Sohel Rahman, Mohammad Kaykobad, Eric G. Manning, Gholamali C. Shoja:
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls. Comput. Oper. Res. 33: 1259-1273 (2006) - Víctor M. Albornoz, Cristian M. Canales:
Total allowable catch for managing squat lobster fishery using stochastic nonlinear programming. Comput. Oper. Res. 33: 2113-2124 (2006) - M. Montaz Ali:
Global optimization models in data networks: a case study. Comput. Oper. Res. 33: 1437-1458 (2006) - Abdullah M. S. Alkahtani, Michael E. Woodward, Khalid Al-Begain:
Prioritised best effort routing with four quality of service metrics applying the concept of the analytic hierarchy process. Comput. Oper. Res. 33: 559-580 (2006) - Ali Allahverdi, Fawaz S. Al-Anzi:
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Comput. Oper. Res. 33: 1056-1080 (2006) - Hamid Allaoui, Abdelhakim Artiba:
Scheduling two-stage hybrid flow shop with availability constraints. Comput. Oper. Res. 33: 1399-1419 (2006) - Othman Ibraheem Alsalloum, Graham K. Rand:
Extensions to emergency vehicle location models. Comput. Oper. Res. 33: 2725-2743 (2006) - Eitan Altman, Thomas Boulogne, Rachid El Azouzi, Tania Jiménez, Laura Wynter:
A survey on networking games in telecommunications. Comput. Oper. Res. 33: 286-311 (2006) - U. F. Aminu, Richard W. Eglese:
A constraint programming approach to the Chinese postman problem with time windows. Comput. Oper. Res. 33(12): 3423-3431 (2006) - Hatem Ben Amor, Jacques Desrosiers:
A proximal trust-region algorithm for column generation stabilization. Comput. Oper. Res. 33: 910-927 (2006) - Julián Aráoz, Elena Fernández, Cristina Zoltan:
Privatized rural postman problems. Comput. Oper. Res. 33(12): 3432-3449 (2006) - Halvard Arntzen, Lars Magnus Hvattum, Arne Løkketangen:
Adaptive memory search for multidemand multidimensional knapsack problems. Comput. Oper. Res. 33: 2508-2525 (2006) - P. V. (Sundar) Balakrishnan, Rakesh Gupta, Varghese S. Jacob:
An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs. Comput. Oper. Res. 33: 639-659 (2006) - Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi:
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33: 2667-2702 (2006) - Richard Baron, Jacques Durieu, Hans Haller, Philippe Solal:
Complexity and stochastic evolution of dyadic networks. Comput. Oper. Res. 33: 312-327 (2006) - Giovanni Di Bartolomeo, Jacob Engwerda, Joseph Plasmans, Bas van Aarle:
Staying together or breaking apart: policy-makers' endogenous coalitions formation in the European Economic and Monetary Union. Comput. Oper. Res. 33: 438-463 (2006) - Thomas Bartsch, Andreas Drexl, Stefan Kröger:
Scheduling the professional soccer leagues of Austria and Germany. Comput. Oper. Res. 33: 1907-1937 (2006) - Jakub Bauman, Joanna Józefowska:
Minimizing the earliness-tardiness costs on a single machine. Comput. Oper. Res. 33(11): 3219-3230 (2006) - Mathieu Beaulieu, Michel Gamache:
An enumeration algorithm for solving the fleet management problem in underground mines. Comput. Oper. Res. 33: 1606-1624 (2006) - Nicolas Beldiceanu, Mats Carlsson, Sven Thiel:
Sweep synchronization as a global propagation mechanism. Comput. Oper. Res. 33(10): 2835-2851 (2006) - José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins:
Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33(12): 3363-3383 (2006) - Mohamed Ben-Daya, Syed Mobasher Noman, Moncer A. Hariga:
Integrated inventory control and inspection policies with deterministic demand. Comput. Oper. Res. 33: 1625-1638 (2006) - Russell Bent, Pascal Van Hentenryck:
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33: 875-893 (2006) - Stefan Bertels, Torsten Fahle:
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Oper. Res. 33(10): 2866-2890 (2006) - Jean-François Bérubé, Jean-Yves Potvin, Jean G. Vaucher:
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem. Comput. Oper. Res. 33: 1838-1856 (2006) - Ernesto G. Birgin, José Mario Martínez, F. H. Nishihara, Débora P. Ronconi:
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Comput. Oper. Res. 33(12): 3535-3548 (2006)
skipping 178 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-04-25 19:18 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