Остановите войну!
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 80 matches
- 2010
- Roberto Baldacci, Mauro Dell'Amico:
Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203(1): 270-281 (2010) - Philippe Baptiste, Ruslan Sadykov:
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. Eur. J. Oper. Res. 203(2): 476-483 (2010) - Sylvain Béal, Eric Rémila, Philippe Solal:
Rooted-tree solutions for tree games. Eur. J. Oper. Res. 203(2): 404-408 (2010) - Fayez F. Boctor:
Offsetting inventory replenishment cycles to minimize storage space. Eur. J. Oper. Res. 203(2): 321-325 (2010) - Denis Bouyssou, Thierry Marchant:
Additive conjoint measurement with ordered categories. Eur. J. Oper. Res. 203(1): 195-204 (2010) - Fidan Boylu, Haldun Aytug, Gary J. Koehler:
Induction over constrained strategic agents. Eur. J. Oper. Res. 203(3): 698-705 (2010) - Edmund K. Burke, Jingpeng Li, Rong Qu:
A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. Eur. J. Oper. Res. 203(2): 484-493 (2010) - Haoya Chen, Youhua (Frank) Chen, Chun-Hung Chiu, Tsan-Ming Choi, Suresh P. Sethi:
Coordination mechanism for the supply chain with leadtime consideration and price-dependent demand. Eur. J. Oper. Res. 203(1): 70-80 (2010) - Chien-Ming Chen, Jan van Dalen:
Measuring dynamic efficiency: Theories and an integrated methodology. Eur. J. Oper. Res. 203(3): 749-760 (2010) - Lijian Chen, Tito Homem-de-Mello:
Mathematical programming models for revenue management under customer choice. Eur. J. Oper. Res. 203(2): 294-305 (2010) - Lei Chen, Di Yuan:
Solving a minimum-power covering problem with overlap constraint for cellular network design. Eur. J. Oper. Res. 203(3): 714-723 (2010) - Chi Chiang:
An order expediting policy for continuous review systems with manufacturing lead-time. Eur. J. Oper. Res. 203(2): 526-531 (2010) - Matthew Colvin, Christos T. Maravelias:
Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming. Eur. J. Oper. Res. 203(1): 205-215 (2010) - Andre Costa, M. Ramakrishnan, Peter G. Taylor:
A distributed approach to capacity allocation in logical networks. Eur. J. Oper. Res. 203(3): 737-748 (2010) - Yucheng Dong, Yinfeng Xu, Hongyi Li, Bo Feng:
The OWA-based consensus operator under linguistic representation models using position indexes. Eur. J. Oper. Res. 203(2): 455-463 (2010) - Frédéric Dugardin, Farouk Yalaoui, Lionel Amodeo:
New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur. J. Oper. Res. 203(1): 22-31 (2010) - Antonis Economou, Stella Kapodistria:
Synchronized abandonments in a single server unreliable queue. Eur. J. Oper. Res. 203(1): 143-155 (2010) - Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
The Attractive Traveling Salesman Problem. Eur. J. Oper. Res. 203(1): 59-69 (2010) - Valtteri Ervasti, Riikka-Leena Leskelä:
Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support. Eur. J. Oper. Res. 203(1): 251-260 (2010) - Bo Feng, Zhong-Zhong Jiang, Zhi-Ping Fan, Na Fu:
A method for member selection of cross-functional teams using the individual and collaborative performances. Eur. J. Oper. Res. 203(3): 652-661 (2010) - Geraldo Ferrer, Jayashankar M. Swaminathan:
Managing new and differentiated remanufactured products. Eur. J. Oper. Res. 203(2): 370-379 (2010) - Kostas Florios, George Mavrotas, Danae Diakoulaki:
Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms. Eur. J. Oper. Res. 203(1): 14-21 (2010) - Fiorenzo Franceschini, Domenico A. Maisano:
Analysis of the Hirsch index's operational properties. Eur. J. Oper. Res. 203(2): 494-504 (2010) - Cord-Ulrich Fündeling, Norbert Trautmann:
A priority-rule method for project scheduling with work-content constraints. Eur. J. Oper. Res. 203(3): 568-574 (2010) - Mateusz Gorczyca, Adam Janiak:
Resource level minimization in the discrete-continuous scheduling. Eur. J. Oper. Res. 203(1): 32-41 (2010) - Ana Groznik, H. Sebastian Heese:
Supply chain interactions due to store-brand introductions: The impact of retail competition. Eur. J. Oper. Res. 203(3): 575-582 (2010) - Robert W. Grubbström:
The Newsboy problem when customer demand is a compound renewal process. Eur. J. Oper. Res. 203(1): 134-142 (2010) - Peter Grundke:
Top-down approaches for integrated risk management: How accurate are they? Eur. J. Oper. Res. 203(3): 662-672 (2010) - Jinxiang Gu, Marc Goetschalckx, Leon F. McGinnis:
Research on warehouse design and performance evaluation: A comprehensive review. Eur. J. Oper. Res. 203(3): 539-549 (2010) - Peijun Guo, Hideo Tanaka:
Decision making with interval probabilities. Eur. J. Oper. Res. 203(2): 444-454 (2010)
skipping 50 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-01 16:47 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