| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-cut algorithm for the capacitated profitable tour problem
|
Jepsen, Mads Kehlet
|
|
2014
|
14 |
C |
p. 78-96
19 p.
|
artikel
|
| 2 |
A new separation algorithm for the Boolean quadric and cut polytopes
|
Letchford, Adam N.
|
|
2014
|
14 |
C |
p. 61-71
11 p.
|
artikel
|
| 3 |
A polynomial algorithm for the two-connections variant of the tree p -median problem
|
Chrétienne, Philippe
|
|
2014
|
14 |
C |
p. 1-16
16 p.
|
artikel
|
| 4 |
A revised reformulation-linearization technique for the quadratic assignment problem
|
Rostami, Borzou
|
|
2014
|
14 |
C |
p. 97-103
7 p.
|
artikel
|
| 5 |
Connected matchings in chordal bipartite graphs
|
Jobson, Adam S.
|
|
2014
|
14 |
C |
p. 34-45
12 p.
|
artikel
|
| 6 |
Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
|
Wimer, Shmuel
|
|
2014
|
14 |
C |
p. 104-110
7 p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
2014
|
14 |
C |
p. IFC-
1 p.
|
artikel
|
| 8 |
Four-point conditions for the TSP: The complete complexity classification
|
Deineko, Vladimir G.
|
|
2014
|
14 |
C |
p. 147-159
13 p.
|
artikel
|
| 9 |
Huge multiway table problems
|
Onn, Shmuel
|
|
2014
|
14 |
C |
p. 72-77
6 p.
|
artikel
|
| 10 |
Linear programming insights into solvable cases of the quadratic assignment problem
|
Adams, Warren
|
|
2014
|
14 |
C |
p. 46-60
15 p.
|
artikel
|
| 11 |
Multi-dimensional vector assignment problems
|
Dokka, Trivikram
|
|
2014
|
14 |
C |
p. 111-125
15 p.
|
artikel
|
| 12 |
Pareto optimality in many-to-many matching problems
|
Cechlárová, Katarína
|
|
2014
|
14 |
C |
p. 160-169
10 p.
|
artikel
|
| 13 |
Relay placement for two-connectivity
|
Calinescu, Gruia
|
|
2014
|
14 |
C |
p. 17-33
17 p.
|
artikel
|
| 14 |
The complexity of finding harmless individuals in social networks
|
Bazgan, Cristina
|
|
2014
|
14 |
C |
p. 170-182
13 p.
|
artikel
|
| 15 |
Towards an efficient resolution of printing problems
|
Tuyttens, Daniel
|
|
2014
|
14 |
C |
p. 126-146
21 p.
|
artikel
|
Tijdschrift beschrijving