Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Operational Research, Volume 208
Volume 208, Number 1, January 2011
- Leroy White, Honora Smith
, Christine S. M. Currie:
OR in developing countries: A review. 1-11
- Xiaozheng He, Henry X. Liu:
Inverse variational inequalities with projection-based solution methods. 12-18 - Alireza Kabirian, Sigurdur Ólafsson:
Continuous optimization via simulation using Golden Region search. 19-27 - Zhenjun Shi, Shengquan Wang:
Nonmonotone adaptive trust region method. 28-36
- Ali Amiri, Reza Barkhi:
The combinatorial bandwidth packing problem. 37-45 - Kevin M. Curtin, Steve Biba:
The Transit Route Arc-Node Service Maximization problem. 46-56 - Tarun Bhaskar, Manabendra N. Pal, Asim K. Pal:
A heuristic method for RCPSP with fuzzy activity times. 57-66
- Adnène Hajji, Ali Gharbi, Jean-Pierre Kenné, Robert Pellerin:
Production control and replenishment strategy with multiple suppliers. 67-74 - Richard Pibernik, Yingying Zhang, Florian Kerschbaum, Axel Schröpfer:
Secure collaborative supply chain planning and inverse optimization - The JELS model. 75-85 - Marielle Christiansen, Kjetil Fagerholt, Truls Flatberg, Øyvind Haugen, Oddvar Kloster, Erik H. Lund:
Maritime inventory routing with multiple products: A case study from the cement industry. 86-94
Volume 208, Number 2, January 2011
- Carl Chiarella, Viviana Fanelli, Silvana Musti:
Modelling the evolution of credit spreads using the Cox process within the HJM framework: A CDS option pricing model. 95-108
- Cristiano Cervellera, Danilo Macciò:
A comparison of global and semi-local approximation in T-stage stochastic optimization. 109-118 - Pietro De Giovanni:
Quality improvement vs. advertising support: Which strategy works better for a manufacturer? 119-130 - Noemí Zoroa, M. José Fernández-Sáez, Procopio Zoroa:
A foraging problem: Sit-and-wait versus active predation. 131-141 - Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov:
The simplified partial digest problem: Approximation and a graph-theoretic model. 142-152 - Trevor Collier, Andrew L. Johnson, John Ruggiero:
Technical efficiency estimation with multiple inputs and multiple outputs using regression analysis. 153-160 - Alison Kulp, Joseph C. Hartman:
Optimal tax depreciation with loss carry-forward and backward options. 161-169 - Subal C. Kumbhakar:
Estimation of production technology when the objective is to maximize return to the outlay. 170-176
Volume 208, Number 3, February 2011
- Jan Weglarz, Joanna Józefowska, Marek Mika, Grzegorz Waligóra:
Project scheduling with finite or infinite number of activity processing modes - A survey. 177-205
- Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution. 206-220 - Daniel Karapetyan, Gregory Z. Gutin:
Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem. 221-232 - Oded Berman, Jiamin Wang:
The minmax regret gradual covering location problem on a network with incomplete information of demand weights. 233-238
- Kuo-Chen Hung:
An inventory model with generalized type demand, deterioration and backorder rates. 239-242 - Hong-Sen Yan, Kai-Ping Ma:
Competitive diffusion process of repurchased products in knowledgeable manufacturing. 243-252 - Tatiana Bassetto, Francesco Mason:
Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs. 253-262
a service of 
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.
last updated on 2024-04-25 04:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
