Остановите войну!
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 66 matches
- 2006
- Gautam Appa, H. Paul Williams:
A new framework for the solution of DEA models. Eur. J. Oper. Res. 172(2): 604-615 (2006) - Dieter Armbruster, Esma Senturk Gel:
Bucket brigades revisited: Are they always effective? Eur. J. Oper. Res. 172(1): 213-229 (2006) - Ingólfur Arnarson, Pall Jensson:
Impact of the cost of the time resource on efficiency of economic processes. Eur. J. Oper. Res. 172(2): 616-630 (2006) - Giorgio Ausiello, Vangelis Th. Paschos:
Reductions, completeness and the hardness of approximability. Eur. J. Oper. Res. 172(3): 719-739 (2006) - Amir Azaron, Hideki Katagiri, Masatoshi Sakawa, Kosuke Kato, Azizollah Memariani:
A multi-objective resource allocation problem in PERT networks. Eur. J. Oper. Res. 172(3): 838-854 (2006) - Gustavo Bergantiños, Juan J. Vidal-Puga:
Additive rules in discrete allocation problems. Eur. J. Oper. Res. 172(3): 971-978 (2006) - Andreas Bortfeldt:
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur. J. Oper. Res. 172(3): 814-837 (2006) - Joyce Brown, Ceri Cooper, Michael Pidd:
A taxing problem: The complementary use of hard and soft OR in the public sector. Eur. J. Oper. Res. 172(2): 666-679 (2006) - Rafael Caballero, Mónica Hernández:
Restoration of efficiency in a goal programming problem with linear fractional criteria. Eur. J. Oper. Res. 172(1): 31-39 (2006) - Steven B. Caudill:
Estimating the circle closest to a set of points by maximum likelihood using the BHHH algorithm. Eur. J. Oper. Res. 172(1): 120-126 (2006) - Liang-Hsuan Chen, Ming-Chu Weng:
An evaluation approach to engineering design in QFD processes using fuzzy goal programming models. Eur. J. Oper. Res. 172(1): 230-248 (2006) - Wade D. Cook:
Distance-based and ad hoc consensus models in ordinal preference ranking. Eur. J. Oper. Res. 172(2): 369-385 (2006) - Barry P. Cuffe, Moshe F. Friedman:
On the exact distribution of a delayed renewal process with exponential sum interarrival times. Eur. J. Oper. Res. 172(3): 909-918 (2006) - Maciej Drozdowski, Pawel Wolniewicz:
Optimum divisible load scheduling on heterogeneous stars with limited memory. Eur. J. Oper. Res. 172(2): 545-559 (2006) - Chung-Yuan Dye, Horng-Jinh Chang, Jinn-Tsair Teng:
A deteriorating inventory model with time-varying demand and shortage-dependent partial backlogging. Eur. J. Oper. Res. 172(2): 417-429 (2006) - Harel Eilat, Boaz Golany, Avraham Shtub:
Constructing and evaluating balanced portfolios of R&D projects with interactions: A DEA based methodology. Eur. J. Oper. Res. 172(3): 1018-1039 (2006) - Tomoe Entani, Hideo Tanaka:
Improvement of efficiency intervals based on DEA by adjusting inputs and outputs. Eur. J. Oper. Res. 172(3): 1004-1017 (2006) - B. Esteve, C. Aubijoux, A. Chartier, Vincent T'kindt:
A recovering beam search algorithm for the single machine Just-in-Time scheduling problem. Eur. J. Oper. Res. 172(3): 798-813 (2006) - Gustav Feichtinger, Richard F. Hartl, Peter M. Kort, Vladimir M. Veliov:
Capital accumulation under technological progress and learning: A vintage capital approach. Eur. J. Oper. Res. 172(1): 293-310 (2006) - Roberto D. Galvão, Luis Gonzalo Acosta Espejo, Brian Boffey, Derek F. Yates:
Load balancing and capacity constraints in a hierarchical location model. Eur. J. Oper. Res. 172(2): 631-646 (2006) - Michel Gendreau, Jean-Yves Potvin, Ali Smires, Patrick Soriano:
Multi-period capacity expansion for a local access telecommunications network. Eur. J. Oper. Res. 172(3): 1051-1066 (2006) - Tony Van Gestel, Bart Baesens, Johan A. K. Suykens, Dirk Van den Poel, Dirk-Emma Baestaens, Marleen Willekens:
Bayesian kernel based classification for financial distress detection. Eur. J. Oper. Res. 172(3): 979-1003 (2006) - Alexander Grigoriev, Joris van de Klundert, Frits C. R. Spieksma:
Modeling and solving the periodic maintenance problem. Eur. J. Oper. Res. 172(3): 783-797 (2006) - Eugene David Hahn:
Link function selection in stochastic multicriteria decision making models. Eur. J. Oper. Res. 172(1): 86-100 (2006) - Mhand Hifi, Rym M'Hallah:
Strip generation algorithms for constrained two-dimensional two-staged cutting problems. Eur. J. Oper. Res. 172(2): 515-527 (2006) - Ryusuke Hohzaki:
Search allocation game. Eur. J. Oper. Res. 172(1): 101-119 (2006) - Gaofeng Huang, Andrew Lim:
A hybrid genetic algorithm for the Three-Index Assignment Problem. Eur. J. Oper. Res. 172(1): 249-257 (2006) - Dennis Huisman, Albert P. M. Wagelmans:
A solution approach for dynamic vehicle and crew scheduling. Eur. J. Oper. Res. 172(2): 453-471 (2006) - Herbert Jodlbauer:
An approach for integrated scheduling and lot-sizing. Eur. J. Oper. Res. 172(2): 386-400 (2006) - Nan Kong, Andrew J. Schaefer:
A factor 1/2 approximation algorithm for two-stage stochastic matching problems. Eur. J. Oper. Res. 172(3): 740-746 (2006)
skipping 36 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-24 06:31 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