| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An improved Benders decomposition applied to a multi-layer network design problem
|
Fortz, B.
|
|
2009
|
37 |
5 |
p. 359-364
6 p.
|
artikel
|
| 2 |
An inventory system with two suppliers and default risk
|
Yan, Xiaoming
|
|
2009
|
37 |
5 |
p. 322-326
5 p.
|
artikel
|
| 3 |
A note on the subadditive network design problem
|
Bateni, M.
|
|
2009
|
37 |
5 |
p. 339-344
6 p.
|
artikel
|
| 4 |
A powerful route minimization heuristic for the vehicle routing problem with time windows
|
Nagata, Yuichi
|
|
2009
|
37 |
5 |
p. 333-338
6 p.
|
artikel
|
| 5 |
A short note on the weighted sub-partition mean of integers
|
Szabó, Peter
|
|
2009
|
37 |
5 |
p. 356-358
3 p.
|
artikel
|
| 6 |
A superclass of Edge-Path-Tree graphs with few cliques
|
Apollonio, Nicola
|
|
2009
|
37 |
5 |
p. 351-355
5 p.
|
artikel
|
| 7 |
Asymptotic optimality of the static frequency caching in the presence of correlated requests
|
Jelenković, Predrag R.
|
|
2009
|
37 |
5 |
p. 307-311
5 p.
|
artikel
|
| 8 |
Bias optimality for multichain continuous-time Markov decision processes
|
Guo, Xianping
|
|
2009
|
37 |
5 |
p. 317-321
5 p.
|
artikel
|
| 9 |
Covering skew-supermodular functions by hypergraphs of minimum total size
|
Bernáth, Attila
|
|
2009
|
37 |
5 |
p. 345-350
6 p.
|
artikel
|
| 10 |
Editorial Board
|
|
|
2009
|
37 |
5 |
p. IFC-
1 p.
|
artikel
|
| 11 |
Instability of FIFO in a simple queueing system with arbitrarily low loads
|
Tezcan, Tolga
|
|
2009
|
37 |
5 |
p. 312-316
5 p.
|
artikel
|
| 12 |
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
|
Tamir, Arie
|
|
2009
|
37 |
5 |
p. 303-306
4 p.
|
artikel
|
| 13 |
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
|
Tian, Zhongjun
|
|
2009
|
37 |
5 |
p. 368-374
7 p.
|
artikel
|
| 14 |
Risk-sensitive dynamic pricing for a single perishable product
|
Li, Michael Z.F.
|
|
2009
|
37 |
5 |
p. 327-332
6 p.
|
artikel
|
| 15 |
The counting complexity of a simple scheduling problem
|
Berbeglia, Gerardo
|
|
2009
|
37 |
5 |
p. 365-367
3 p.
|
artikel
|
| 16 |
Uniform multicommodity flow through the complete graph with random edge-capacities
|
Aldous, David J.
|
|
2009
|
37 |
5 |
p. 299-302
4 p.
|
artikel
|
Tijdschrift beschrijving