| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Analysis of optimal and nearly optimal sequencing policies for a closed queueing network
|
Gilland, Wendell G.
|
|
2005
|
33 |
1 |
p. 9-16
8 p.
|
article
|
| 2 |
An invariance property of sojourn times in cyclic networks
|
Malchin, Christian
|
|
2005
|
33 |
1 |
p. 1-8
8 p.
|
article
|
| 3 |
A simple recipe for concise mixed 0-1 linearizations
|
Adams, Warren P.
|
|
2005
|
33 |
1 |
p. 55-61
7 p.
|
article
|
| 4 |
Asymptotic analysis of stochastic block replacement policies for multicomponent systems in a Markov environment
|
Anisimov, Vladimir V.
|
|
2005
|
33 |
1 |
p. 26-34
9 p.
|
article
|
| 5 |
Branching rules revisited
|
Achterberg, Tobias
|
|
2005
|
33 |
1 |
p. 42-54
13 p.
|
article
|
| 6 |
Editorial Board
|
|
|
2005
|
33 |
1 |
p. IFC-
1 p.
|
article
|
| 7 |
Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls
|
Schochetman, Irwin E.
|
|
2005
|
33 |
1 |
p. 97-104
8 p.
|
article
|
| 8 |
Lift-and-project ranks and antiblocker duality
|
Lipták, László
|
|
2005
|
33 |
1 |
p. 35-41
7 p.
|
article
|
| 9 |
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
|
Sarin, Subhash C.
|
|
2005
|
33 |
1 |
p. 62-70
9 p.
|
article
|
| 10 |
On the complexity of the k-customer vehicle routing problem
|
Hassin, Refael
|
|
2005
|
33 |
1 |
p. 71-76
6 p.
|
article
|
| 11 |
Optimal replenishment policy for product with season pattern demand
|
You, Peng Sheng
|
|
2005
|
33 |
1 |
p. 90-96
7 p.
|
article
|
| 12 |
Polling systems with periodic server routing in heavy traffic: renewal arrivals
|
Olsen, Tava Lennon
|
|
2005
|
33 |
1 |
p. 17-25
9 p.
|
article
|
| 13 |
Project scheduling: a review of recent books
|
Kis, Tamás
|
|
2005
|
33 |
1 |
p. 105-110
6 p.
|
article
|
| 14 |
Transport risk models for hazardous materials: revisited
|
Erkut, Erhan
|
|
2005
|
33 |
1 |
p. 81-89
9 p.
|
article
|
| 15 |
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
|
Xiong, Yupei
|
|
2005
|
33 |
1 |
p. 77-80
4 p.
|
article
|
Journal description