


default search action
Annals of Operations Research, Volume 172
Volume 172, Number 1, November 2009
- Ramesh Arumugam, Maria E. Mayorga

, Kevin M. Taaffe:
Inventory based allocation policies for flexible servers in serial systems. 1-23 - Yury Nikulin:

Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies. 25-35 - Majid Soleimani-Damaneh

, Masoud Zarepisheh:
Linear transformations to decrease computational requirements of solving some known linear programming models. 37-43 - Jesús Sáez Aguado:

Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems. 45-69 - Sergio Consoli

, Ken Darby-Dowman, Nenad Mladenovic
, José A. Moreno-Pérez
:
Variable neighbourhood search for the minimum labelling Steiner tree problem. 71-96 - Donatien Hainaut:

Dynamic asset allocation under VaR constraint with stochastic interest rates. 97-117 - Rob J. I. Basten, J. M. J. Schutten

, M. C. van der Heijden:
An efficient model formulation for level of repair analysis. 119-142 - Wei Xiong, Tayfur Altiok:

An approximation for multi-server queues with deterministic reneging times. 143-151 - Thiemo Krink, Stefan Mittnik

, Sandra Paterlini
:
Differential evolution and combinatorial search for constrained index-tracking. 153-176 - Reza Farzipoor Saen

:
A decision model for ranking suppliers in the presence of cardinal and ordinal data, weight restrictions, and nondiscretionary factors. 177-192 - Chunyang Zhou, Chongfeng Wu, Yun Feng:

An exact algorithm for the type-constrained and variable sized bin packing problem. 193-202 - Sebastian Sitarz

:
Pareto optimal allocations and dynamic programming. 203-219 - Adam Kasperski

, Pawel Zielinski
:
A randomized algorithm for the min-max selecting items problem with uncertain weights. 221-230 - Maria E. Mayorga

, Kevin M. Taaffe, Ramesh Arumugam:
Allocating flexible servers in serial systems with switching costs. 231-242 - Armin Scholl, Nils Boysen

, Malte Fliedner:
Optimally solving the alternative subgraphs assembly line balancing problem. 243-258 - Illana Bendavid, Boaz Golany:

Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology. 259-276 - Sameh S. Askar, Ashutosh Tiwari

:
First-order optimality conditions and duality results for multi-objective optimisation problems. 277-289 - Özgecan S. Ulusçu, Tayfur Altiok:

Waiting time approximation in single-class queueing systems with multiple types of interruptions: modeling congestion at waterways entrances. 291-313 - Dar-Li Yang

, Wen-Hung Kuo:
Single-machine scheduling with both deterioration and learning effects. 315-327 - Jenn-Rong Lin

, Hsien-Chung Lei:
Distribution systems design with two-level routing considerations. 329-347 - Masashi Miyagawa:

Optimal hierarchical system of a grid road network. 349-361 - M. Josune Albizuri

:
The multichoice coalition value. 363-374 - Kimmo Berg

, Harri Ehtamo:
Learning in nonlinear pricing with unknown utility functions. 375-392 - Elisabeth Gassner:

A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric. 393-404 - Önder Baris Asik, Ender Özcan

:
Bidirectional best-fit heuristic for orthogonal rectangular strip packing. 405-427 - Tomás Müller:

ITC2007 solver description: a hybrid approach. 429-446 - Pritibhushan Sinha

:
Assignment problems with changeover cost. 447-457 - Reza Ramezanian

, A. Karamouzian:
Comments on "Scheduling jobs on a k-stage flexible flow-shop" [Annals of Operations Research (2008) 164: 29-40]. 459-462 - Genaro J. Gutierrez, Panagiotis Kouvelis

, Lawrence V. Snyder:
Errata for "A robustness approach to international sourcing" by G.J. Gutierrez and P. Kouvelis, Annals of Operations Research 59 (1995) 165-193. 463

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














