Остановите войну!
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 45 matches
- 2000
- Jonas Andersson, Johan Marklund:
Decentralized inventory control in a two-level distribution system. Eur. J. Oper. Res. 127(3): 483-506 (2000) - Cécile Arondel, Philippe Girardin:
Sorting cropping systems on the basis of their impact on groundwater quality. Eur. J. Oper. Res. 127(3): 467-482 (2000) - Christian Artigues, François Roubellat:
A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. Eur. J. Oper. Res. 127(2): 297-316 (2000) - Kenneth R. Baker, Michael J. Magazine:
Minimizing maximum lateness with job families. Eur. J. Oper. Res. 127(1): 126-139 (2000) - Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna:
The disjunctive graph machine representation of the job shop scheduling problem. Eur. J. Oper. Res. 127(2): 317-331 (2000) - Denis Borenstein:
A directed acyclic graph representation of routing manufacturing flexibility. Eur. J. Oper. Res. 127(1): 78-93 (2000) - Peter Brucker, Sigrid Knust:
A linear programming and constraint propagation-based lower bound for the RCPSP. Eur. J. Oper. Res. 127(2): 355-362 (2000) - Jacques Carlier, Emmanuel Néron:
A new LP-based lower bound for the cumulative scheduling problem. Eur. J. Oper. Res. 127(2): 363-382 (2000) - Chao-Hsien Chu, G. Premkumar, Hsinghua Chou:
Digital data networks design using genetic algorithms. Eur. J. Oper. Res. 127(1): 140-158 (2000) - Ray Deitch, Shaul P. Ladany:
The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm. Eur. J. Oper. Res. 127(1): 69-77 (2000) - C. Duri, Yannick Frein, Maria di Mascolo:
Performance evaluation and design of base stock systems. Eur. J. Oper. Res. 127(1): 172-188 (2000) - John S. Edwards, Paul N. Finlay, John M. Wilson:
The role of OR specialists in 'do it yourself' spreadsheet development. Eur. J. Oper. Res. 127(1): 14-27 (2000) - Salah E. Elmaghraby:
On criticality and sensitivity in activity networks. Eur. J. Oper. Res. 127(2): 220-238 (2000) - Olaf E. Flippo, Antoon W. J. Kolen, Arie M. C. A. Koster, Robert L. M. J. van de Leensel:
A dynamic programming algorithm for the local access telecommunication network expansion problem. Eur. J. Oper. Res. 127(1): 189-202 (2000) - A. J. R. M. Gademann, Steef L. van de Velde:
Positioning automated guided vehicles in a loop layout. Eur. J. Oper. Res. 127(3): 565-573 (2000) - Christelle Guéret, Narendra Jussien, Christian Prins:
Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems. Eur. J. Oper. Res. 127(2): 344-354 (2000) - Sönke Hartmann, Rainer Kolisch:
Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127(2): 394-407 (2000) - Chaug-Ing Hsu, Yuh-Horng Wen:
Application of Grey theory and multiobjective programming towards airline network design. Eur. J. Oper. Res. 127(1): 44-68 (2000) - Hark Hwang, Kyu Hun Hahn:
An optimal procurement policy for items with an inventory level-dependent demand rate and fixed lifetime. Eur. J. Oper. Res. 127(3): 537-545 (2000) - Piotr Jedrzejowicz, Izabela Wierzbowska:
Scheduling multiple variant programs under hard real-time constraints. Eur. J. Oper. Res. 127(2): 458-465 (2000) - John B. Jensen:
The impact of resource flexibility and staffing decisions on cellular and departmental shop performance. Eur. J. Oper. Res. 127(2): 279-296 (2000) - Trond Jørgensen, Stein W. Wallace:
Improving project cost estimation by taking into account managerial flexibility. Eur. J. Oper. Res. 127(2): 239-251 (2000) - Robert Klein:
Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. Eur. J. Oper. Res. 127(3): 619-638 (2000) - George J. Kyparisis, Christos Koulamas:
Flow shop and open shop scheduling with a critical machine and two operations per job. Eur. J. Oper. Res. 127(1): 120-125 (2000) - Manuel Laguna, M. Pilar Lino Sorlí, M. Angeles Pérez Alarcó, M. Sacramento Quintanilla, Vicente Valls:
Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines. Eur. J. Oper. Res. 127(2): 444-457 (2000) - Antonio Luis Lova, Concepción Maroto, María Pilar Tormos:
A multicriteria heuristic method to improve resource allocation in multiproject scheduling. Eur. J. Oper. Res. 127(2): 408-424 (2000) - Shashi Kant Mishra:
Second order symmetric duality in mathematical programming with F-convexity. Eur. J. Oper. Res. 127(3): 507-518 (2000) - Klaus Neumann, Jürgen Zimmermann:
Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. Eur. J. Oper. Res. 127(2): 425-443 (2000) - Jorge Oviedo:
The core of a repeated n-person cooperative game. Eur. J. Oper. Res. 127(3): 519-524 (2000) - Gadi Rabinowitz, Shai Goren, Abraham Mehrez:
Scheduling two machines that require multiple types of maintenance, for a single operation. Eur. J. Oper. Res. 127(3): 546-564 (2000)
skipping 15 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-06-24 08:59 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