![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 53 matches
- 1998
- Agha Iqbal Ali, Hyun-Soo Han:
Computational implementation of Fujishige's graph realizability algorithm. Eur. J. Oper. Res. 108(2): 452-463 (1998) - Talal M. Alkhamis, Merza Hasan, Mohamed A. Ahmed:
Simulated annealing for the unconstrained quadratic pseudo-Boolean function. Eur. J. Oper. Res. 108(3): 641-652 (1998) - Mohammad M. Amini, Michael Racer, Parviz Ghandforoush:
Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study. Eur. J. Oper. Res. 108(3): 604-617 (1998) - Kim Allan Andersen:
On consistency in probabilistic logic for logical formulas represented by B-hypertrees. Eur. J. Oper. Res. 108(3): 696-709 (1998) - Indrani Basak:
Probabilistic judgments specified partially in the analytic hierarchy process. Eur. J. Oper. Res. 108(1): 153-164 (1998) - Gaetan Belvaux, Nicolas Boissin, Alain S. Sutter, Laurence A. Wolsey:
Optimal placement of add /drop multiplexers static and dynamic models. Eur. J. Oper. Res. 108(1): 26-35 (1998) - Antonio N. Bojanic
, Steven B. Caudill, Jon M. Ford:
Small-sample properties of ML, COLS, and DEA estimators of frontier models in the presence of heteroscedasticity. Eur. J. Oper. Res. 108(1): 140-148 (1998) - Luis A. Castillo, Antonio González
:
Distribution network optimization: Finding the most economic solution by using genetic algorithms. Eur. J. Oper. Res. 108(3): 527-537 (1998) - Dirk Cattrysse, Zeger Degraeve, Jurgen Tistaert:
Solving the generalised assignment problem using polyhedral results. Eur. J. Oper. Res. 108(3): 618-628 (1998) - Ángel Corberán, José María Sanchis:
The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra. Eur. J. Oper. Res. 108(3): 538-550 (1998) - Christopher Cramer:
Neural networks for image and video compression: A review. Eur. J. Oper. Res. 108(2): 266-282 (1998) - Alejandro Crema
:
A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem. Eur. J. Oper. Res. 108(3): 684-695 (1998) - Sriram Dasu:
Class dependent departure process from multiclass phase queues: Exact and approximate analyses. Eur. J. Oper. Res. 108(2): 379-404 (1998) - Gerhard C. van Dijkhuizen, Aart van Harten:
Two-stage generalized age maintenance of a queue-like production system. Eur. J. Oper. Res. 108(2): 363-378 (1998) - H. A. Elselt:
Perception and information in a competitive location model. Eur. J. Oper. Res. 108(1): 94-105 (1998) - Demetrios Fakinos:
A generalization of symmetric queues. Eur. J. Oper. Res. 108(2): 405-408 (1998) - Gennadi I. Falin
, Jesus R. Artalejo:
A finite source retrial queue. Eur. J. Oper. Res. 108(2): 409-424 (1998) - Ernest H. Forman, Kirti Peniwati:
Aggregating individual judgments and priorities with the analytic hierarchy process. Eur. J. Oper. Res. 108(1): 165-169 (1998) - Erol Gelenbe
:
Biologically inspired operations research. Eur. J. Oper. Res. 108(2): 239-240 (1998) - Erol Gelenbe
, Yonghuan Cao:
Autonomous search for mines. Eur. J. Oper. Res. 108(2): 319-333 (1998) - Erol Gelenbe
, Ali Labed:
G-networks with multiple classes of signals and positive customers. Eur. J. Oper. Res. 108(2): 293-305 (1998) - Anoop Ghanwani:
Neural and delay based heuristics for the Steiner problem in networks. Eur. J. Oper. Res. 108(2): 241-265 (1998) - Peter Hahn, Thomas Grant, Nat Hall:
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. Eur. J. Oper. Res. 108(3): 629-640 (1998) - Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão:
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem. Eur. J. Oper. Res. 108(3): 671-683 (1998) - Ralf Heckmann, Thomas Lengauer:
Computing closely matching upper and lower bounds on textile nesting problems. Eur. J. Oper. Res. 108(3): 473-489 (1998) - Alain Hertz, Vincent Robert:
Constructing a course schedule by solving a series of assignment type problems. Eur. J. Oper. Res. 108(3): 585-603 (1998) - Sung-Hoon Hong, Sang Boo Kim, Hyuck Moo Kwon, Min Koo Lee:
Economic design of screening procedures when the rejected items are reprocessed. Eur. J. Oper. Res. 108(1): 65-73 (1998) - Angus Jeang:
Reliable tool replacement policy for quality and cost. Eur. J. Oper. Res. 108(2): 334-344 (1998) - Udo R. Krieger, Valeri Naoumov, Dietmar Wagner:
Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process. Eur. J. Oper. Res. 108(2): 425-437 (1998) - Sebastián Lozano
, Fernando Guerrero, Luis Onieva
, Juan Larrañeta:
Kohonen maps for solving a class of location-allocation problems. Eur. J. Oper. Res. 108(1): 106-117 (1998)
skipping 23 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-09-04 06:43 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