nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A branch-and-price-and-cut method for computing an optimal bramble
|
Sonuc, Sibel B. |
|
2015 |
18 |
C |
p. 168-188 21 p. |
artikel |
2 |
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
|
Hupp, Lena |
|
2015 |
18 |
C |
p. 193-216 24 p. |
artikel |
3 |
Arc-based integer programming formulations for three variants of proportional symbol maps
|
Cano, Rafael G. |
|
2015 |
18 |
C |
p. 87-110 24 p. |
artikel |
4 |
Edge criticality in secure graph domination
|
Burger, A.P. |
|
2015 |
18 |
C |
p. 111-122 12 p. |
artikel |
5 |
Editorial Board
|
|
|
2015 |
18 |
C |
p. IFC- 1 p. |
artikel |
6 |
Geometric versions of the three-dimensional assignment problem under general norms
|
Ćustić, Ante |
|
2015 |
18 |
C |
p. 38-55 18 p. |
artikel |
7 |
Intersection cuts—standard versus restricted
|
Balas, E. |
|
2015 |
18 |
C |
p. 189-192 4 p. |
artikel |
8 |
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
|
Hirai, Hiroshi |
|
2015 |
18 |
C |
p. 1-37 37 p. |
artikel |
9 |
Metric inequalities for routings on direct connections with application to line planning
|
Borndörfer, Ralf |
|
2015 |
18 |
C |
p. 56-73 18 p. |
artikel |
10 |
Shortest path algorithms for functional environments
|
Boguchwal, Louis |
|
2015 |
18 |
C |
p. 217-251 35 p. |
artikel |
11 |
Supermodular covering knapsack polytope
|
Atamtürk, Alper |
|
2015 |
18 |
C |
p. 74-86 13 p. |
artikel |
12 |
The multi-band robust knapsack problem—A dynamic programming approach
|
Claßen, Grit |
|
2015 |
18 |
C |
p. 123-149 27 p. |
artikel |
13 |
Time-dependent optimization of a multi-item uncertain supply chain network: A hybrid approximation algorithm
|
Hosseini, S. Ahmad |
|
2015 |
18 |
C |
p. 150-167 18 p. |
artikel |