Остановите войну!
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 84 matches
- 2015
- Ali Allahverdi:
The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246(2): 345-378 (2015) - R. K. Amit, Peeyush Mehta, Rajeev R. Tripathi:
Optimal shelf-space stocking policy using stochastic dominance under supply-driven demand uncertainty. Eur. J. Oper. Res. 246(1): 339-342 (2015) - Tal Avinadav, Tatyana Chernonog, Yael Perlman:
Consignment contract for mobile apps between a single retailer and competitive developers with different risk attitudes. Eur. J. Oper. Res. 246(3): 949-957 (2015) - Francesca Beccacece, Emanuele Borgonovo, Greg Buzzard, Alessandra Cillo, Stanley Zionts:
Elicitation of multiattribute value functions through high dimensional model representations: Monotonicity and interactions. Eur. J. Oper. Res. 246(2): 517-527 (2015) - Rudolf Berghammer, Henning Schnoor:
Control of Condorcet voting: Complexity and a Relation-Algebraic approach. Eur. J. Oper. Res. 246(2): 505-516 (2015) - Lotte Berghman, Roel Leus:
Practical solutions for a dock assignment problem with trailer transportation. Eur. J. Oper. Res. 246(3): 787-799 (2015) - Joanna Berlinska:
Scheduling for data gathering networks with data compression. Eur. J. Oper. Res. 246(3): 744-749 (2015) - Taras Bodnar, Nestor Parolya, Wolfgang Schmid:
On the exact solution of the multi-period portfolio choice problem for an exponential utility under return predictability. Eur. J. Oper. Res. 246(2): 528-542 (2015) - Wilko Bolt, David Humphrey:
A frontier measure of U.S. banking competition. Eur. J. Oper. Res. 246(2): 450-461 (2015) - Valeria Borodin, Jean Bourtembourg, Faicel Hnaien, Nacima Labadie:
A multi-step rolled forward chance-constrained model and a proactive dynamic approach for the wheat crop quality control problem. Eur. J. Oper. Res. 246(2): 631-640 (2015) - Philippe De Bruecker, Jorne Van den Bergh, Jeroen Beliën, Erik Demeulemeester:
A model enhancement heuristic for building robust aircraft maintenance personnel rosters with stochastic constraints. Eur. J. Oper. Res. 246(2): 661-673 (2015) - Herminia I. Calvete, Carmen Galé, José A. Iranzo:
Corrigendum to "An efficient evolutionary algorithm for the ring star problem" [Calvete et al. European J. of Operational Research, 231 (2013), 22-33]. Eur. J. Oper. Res. 246(1): 343 (2015) - Miguel Camacho-Collados, Federico Liberatore, José Miguel Angulo:
A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector. Eur. J. Oper. Res. 246(2): 674-684 (2015) - Suresh Chandra, Abha Aggarwal:
On solving matrix games with pay-offs of triangular fuzzy numbers: Certain observations and generalizations. Eur. J. Oper. Res. 246(2): 575-581 (2015) - Kuo-Hao Chang:
A direct search method for unconstrained quantile-based simulation optimization. Eur. J. Oper. Res. 246(2): 487-495 (2015) - Xu Chen, Youyi Feng, Matthew F. Keblis, Jianjun Xu:
Optimal inventory policy for two substitutable products with customer service objectives. Eur. J. Oper. Res. 246(1): 76-85 (2015) - Tatyana Chernonog, Tal Avinadav, Tal Ben-Zvi:
Pricing and sales-effort investment under bi-criteria in a supply chain of virtual products involving risk. Eur. J. Oper. Res. 246(2): 471-475 (2015) - Chun-Hung Chiu, Tsan-Ming Choi, Gang Hao, Xun Li:
Innovative menu of contracts for coordinating a supply chain with multiple mean-variance retailers. Eur. J. Oper. Res. 246(3): 815-826 (2015) - Mei Choi Chiu, Hoi Ying Wong, Jing Zhao:
Commodity derivatives pricing with cointegration and stochastic covariances. Eur. J. Oper. Res. 246(2): 476-486 (2015) - Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem. Eur. J. Oper. Res. 246(2): 392-399 (2015) - Sébastien Destercke, Marie-Hélène Masson, Michael Poss:
Cautious label ranking with label-wise decomposition. Eur. J. Oper. Res. 246(3): 927-935 (2015) - Ding Ding, Mabel C. Chou:
Stowage planning for container ships: A heuristic algorithm to reduce the number of shifts. Eur. J. Oper. Res. 246(1): 242-249 (2015) - Sihan Ding, Ger Koole, Robert D. van der Mei:
On the estimation of the true demand in call centers with redials and reconnects. Eur. J. Oper. Res. 246(1): 250-262 (2015) - José Luis Espinosa-Aranda, Ricardo García-Ródenas, María del Carmen Ramírez-Flores, María Luz López-García, Eusebio Angulo:
High-speed railway scheduling based on user preferences. Eur. J. Oper. Res. 246(3): 772-786 (2015) - Salvador Flores:
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression. Eur. J. Oper. Res. 246(1): 44-50 (2015) - Jose M. Framiñan, Paz Perez-Gonzalez:
On heuristic solutions for the stochastic flowshop scheduling problem. Eur. J. Oper. Res. 246(2): 413-420 (2015) - Chao Fu, Jian-Bo Yang, Shanlin Yang:
A group evidential reasoning approach based on expert reliability. Eur. J. Oper. Res. 246(3): 886-893 (2015) - Hirofumi Fukuyama, Rashed Khanjani Shiraz:
Cost-effectiveness measures on convex and nonconvex technologies. Eur. J. Oper. Res. 246(1): 307-319 (2015) - Chao Gao, Xin Yao, Thomas Weise, Jinlong Li:
An efficient local search heuristic with row weighting for the unicost set covering problem. Eur. J. Oper. Res. 246(3): 750-761 (2015) - Gebhard Geiger:
Risk pricing in a non-expected utility framework. Eur. J. Oper. Res. 246(3): 944-948 (2015)
skipping 54 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-24 04:39 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