| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A dual ascent procedure for the set partitioning problem
|
Boschetti, M.A.
|
|
2008
|
5 |
4 |
p. 735-747
13 p.
|
artikel
|
| 2 |
An algorithm to increase the node-connectivity of a digraph by one
|
Frank, András
|
|
2008
|
5 |
4 |
p. 677-684
8 p.
|
artikel
|
| 3 |
A new construction of 3 ̄ -separable matrices via an improved decoding of Macula’s construction
|
Fu, Hung-Lin
|
|
2008
|
5 |
4 |
p. 700-704
5 p.
|
artikel
|
| 4 |
Bilevel time minimizing transportation problem
|
Sonia,
|
|
2008
|
5 |
4 |
p. 714-723
10 p.
|
artikel
|
| 5 |
Cook, Kannan and Schrijver’s example revisited
|
Li, Yanjun
|
|
2008
|
5 |
4 |
p. 724-734
11 p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
2008
|
5 |
4 |
p. IFC-
1 p.
|
artikel
|
| 7 |
More on online bin packing with two item sizes
|
Epstein, Leah
|
|
2008
|
5 |
4 |
p. 705-713
9 p.
|
artikel
|
| 8 |
Parameterized algorithms for weighted matching and packing problems
|
Wang, Jianxin
|
|
2008
|
5 |
4 |
p. 748-754
7 p.
|
artikel
|
| 9 |
Recent results on well-balanced orientations
|
Bernáth, Attila
|
|
2008
|
5 |
4 |
p. 663-676
14 p.
|
artikel
|
| 10 |
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
|
Belgacem, Tarik
|
|
2008
|
5 |
4 |
p. 755-761
7 p.
|
artikel
|
| 11 |
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
|
Bigras, Louis-Philippe
|
|
2008
|
5 |
4 |
p. 685-699
15 p.
|
artikel
|
Tijdschrift beschrijving