| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A greedy algorithm for multicut and integral multiflow in rooted trees
|
Costa, Marie-Christine
|
|
2003
|
31 |
1 |
p. 21-27
7 p.
|
artikel
|
| 2 |
An algorithm for approximating piecewise linear concave functions from sample gradients
|
Topaloglu, Huseyin
|
|
2003
|
31 |
1 |
p. 66-76
11 p.
|
artikel
|
| 3 |
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
|
Kellerer, Hans
|
|
2003
|
31 |
1 |
p. 35-41
7 p.
|
artikel
|
| 4 |
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
|
Haouari, Mohamed
|
|
2003
|
31 |
1 |
p. 49-52
4 p.
|
artikel
|
| 5 |
A note on the reasonableness of PERT hypotheses
|
Pleguezuelo, Rafael Herrerı́as
|
|
2003
|
31 |
1 |
p. 60-62
3 p.
|
artikel
|
| 6 |
A paradox in equipment replacement under technological improvement
|
Cheevaprawatdomrong, Torpong
|
|
2003
|
31 |
1 |
p. 77-82
6 p.
|
artikel
|
| 7 |
Characterization of Pareto dominance
|
Voorneveld, Mark
|
|
2003
|
31 |
1 |
p. 7-11
5 p.
|
artikel
|
| 8 |
Comparative statics of cell phone plans
|
Lippman, Steven A
|
|
2003
|
31 |
1 |
p. 63-65
3 p.
|
artikel
|
| 9 |
editor list
|
|
|
2003
|
31 |
1 |
p. IFC-
1 p.
|
artikel
|
| 10 |
On local search for the generalized graph coloring problem
|
Vredeveld, Tjark
|
|
2003
|
31 |
1 |
p. 28-34
7 p.
|
artikel
|
| 11 |
On scheduling an unbounded batch machine
|
Liu, Zhaohui
|
|
2003
|
31 |
1 |
p. 42-48
7 p.
|
artikel
|
| 12 |
On Steiner trees and minimum spanning trees in hypergraphs
|
Polzin, Tobias
|
|
2003
|
31 |
1 |
p. 12-20
9 p.
|
artikel
|
| 13 |
On the hardness of evaluating criticality of activities in a planar network with duration intervals
|
Chanas, Stefan
|
|
2003
|
31 |
1 |
p. 53-59
7 p.
|
artikel
|
| 14 |
Renewal analysis of a replacement process
|
Stadje, Wolfgang
|
|
2003
|
31 |
1 |
p. 1-6
6 p.
|
artikel
|
Tijdschrift beschrijving