Остановите войну!
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 48 matches
- 2005
- Ali Amiri:
The selection and scheduling of telecommunication calls with time windows. Eur. J. Oper. Res. 167(1): 243-256 (2005) - Carlos Andrés, José Miguel Albarracín, Guillermina Tormo, Eduardo Vicens, José Pedro García-Sabater:
Group technology in a hybrid flowshop environment: A case study. Eur. J. Oper. Res. 167(1): 272-281 (2005) - Javier de Andrés, Manuel Landajo, Pedro Lorca:
Forecasting business profitability by using classification techniques: A comparative analysis based on a Spanish case. Eur. J. Oper. Res. 167(2): 518-542 (2005) - José Elias Claudio Arroyo, Vinícius Amaral Armentano:
Genetic local search for multi-objective flowshop scheduling problems. Eur. J. Oper. Res. 167(3): 717-738 (2005) - Rudolf Avenhaus, Morton John Canty:
Playing for time: A sequential inspection game. Eur. J. Oper. Res. 167(2): 475-492 (2005) - Patrizia Beraldi, Andrzej Ruszczynski:
Beam search heuristic to solve stochastic integer problems under probabilistic constraints. Eur. J. Oper. Res. 167(1): 35-47 (2005) - Oded Berman, Jiamin Wang, K. P. Sapna:
Optimal management of cross-trained workers in services with negligible switching costs. Eur. J. Oper. Res. 167(2): 349-369 (2005) - Malcolm J. Beynon:
A novel technique of object ranking and classification under ignorance: An application to the corporate failure risk problem. Eur. J. Oper. Res. 167(2): 493-517 (2005) - Denis Bouyssou, Marc Pirlot:
A characterization of concordance relations. Eur. J. Oper. Res. 167(2): 427-443 (2005) - Jung-Tai Chen:
Using the sum-of-uniforms method to generate correlated random variates with certain marginal distribution. Eur. J. Oper. Res. 167(1): 226-242 (2005) - Jayanta Kumar Dey, Samarjit Kar, Manoranjan Maiti:
An interactive method for inventory control with fuzzy lead-time and dynamic demand. Eur. J. Oper. Res. 167(2): 381-397 (2005) - Simon Dunstall, Andrew Wirth:
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. Eur. J. Oper. Res. 167(2): 283-296 (2005) - Mark J. R. Ebben, M. C. van der Heijden, Aart van Harten:
Dynamic transport scheduling under multiple resource constraints. Eur. J. Oper. Res. 167(2): 320-335 (2005) - Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich:
Two-machine shop scheduling: Compromise between flexibility and makespan value. Eur. J. Oper. Res. 167(3): 796-809 (2005) - Carlo Filippi:
A fresh view on the tolerance approach to sensitivity analysis in linear programming. Eur. J. Oper. Res. 167(1): 1-19 (2005) - Roger Filliger, Max-Olivier Hongler:
Cooperative flow dynamics in production lines with buffer level dependent production rates. Eur. J. Oper. Res. 167(1): 116-128 (2005) - José Fernando Gonçalves, Jorge José de Magalhães Mendes, Mauricio G. C. Resende:
A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1): 77-95 (2005) - Pablo Guerrero-García, Ángel Santos-Palomo:
Phase I cycling under the most-obtuse-angle pivot rule. Eur. J. Oper. Res. 167(1): 20-27 (2005) - Jatinder N. D. Gupta, Alex J. Ruiz-Torres:
Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. Eur. J. Oper. Res. 167(3): 679-695 (2005) - Thomas Hanne, Stefan Nickel:
A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects. Eur. J. Oper. Res. 167(3): 663-678 (2005) - Ines Herrero:
Different approaches to efficiency analysis. An application to the Spanish Trawl fleet operating in Moroccan waters. Eur. J. Oper. Res. 167(1): 257-271 (2005) - Han Hoogeveen:
Multicriteria scheduling. Eur. J. Oper. Res. 167(3): 592-623 (2005) - H. C. Huang, Ek Peng Chew, K. H. Goh:
A two-echelon inventory system with transportation capacity constraint. Eur. J. Oper. Res. 167(1): 129-143 (2005) - Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167(1): 48-67 (2005) - Werner Jammernegg, Peter Kischka:
Dynamic, customer-oriented improvement of supply networks. Eur. J. Oper. Res. 167(2): 413-426 (2005) - Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. 167(2): 297-319 (2005) - Rabia K. Kayan, M. Selim Akturk:
A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. Eur. J. Oper. Res. 167(3): 624-643 (2005) - Roy H. Kwon:
Data dependent worst case bounds for weighted set packing. Eur. J. Oper. Res. 167(1): 68-76 (2005) - Peter Letmathe, Nagraj Balakrishnan:
Environmental considerations on the optimal product mix. Eur. J. Oper. Res. 167(2): 398-412 (2005) - Divakaran Liginlal, Terence T. Ow:
On policy capturing with fuzzy measures. Eur. J. Oper. Res. 167(2): 461-474 (2005)
skipping 18 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-31 00:10 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