| * | 2008 |
|---|
| 14 | EE | A. Volgenant:
An addendum on the incremental assignment problem.
Inf. Sci. 178(23): 4583 (2008) |
| 13 | EE | A. Volgenant:
Technical Note - A Note on Parametric Analysis in Linear Assignment.
Operations Research 56(2): 519-522 (2008) |
| 2007 |
|---|
| 12 | EE | P. M. D. Lieshout,
A. Volgenant:
A branch-and-bound algorithm for the singly constrained assignment problem.
European Journal of Operational Research 176(1): 151-164 (2007) |
| 2006 |
|---|
| 11 | EE | A. Volgenant:
An addendum on sensitivity analysis of the optimal assignment.
European Journal of Operational Research 169(1): 338-339 (2006) |
| 10 | EE | C. W. Duin,
A. Volgenant:
Some inverse optimization problems under the Hamming distance.
European Journal of Operational Research 170(3): 887-899 (2006) |
| 2005 |
|---|
| 9 | EE | A. Volgenant:
In: Bernhard Korte and Jens Vygen, Editors, Combinatorial Optimization Theory and Algorithms, second ed., Algorithms and Combinatorics, vol 21, Springer, Berlin (2002) ISBN 3-540-43154-3 543pp.
Oper. Res. Lett. 33(2): 216-217 (2005) |
| 2004 |
|---|
| 8 | EE | A. Teeninga,
A. Volgenant:
Improved heuristics for the traveling purchaser problem.
Computers & OR 31(1): 139-150 (2004) |
| 7 | EE | C. W. Duin,
A. Volgenant,
S. Voß:
Solving group Steiner problems as Steiner problems.
European Journal of Operational Research 154(1): 323-329 (2004) |
| 6 | EE | A. Volgenant:
A note on the assignment problem with seniority and job priority constraints.
European Journal of Operational Research 154(1): 330-335 (2004) |
| 5 | EE | A. Volgenant:
Solving the k.
European Journal of Operational Research 157(2): 322-331 (2004) |
| 4 | EE | A. Volgenant,
C. W. Duin:
On Steiner Versions of (bi)Connectivity in Network Problems.
Graphs and Combinatorics 20(2): 263-273 (2004) |
| 1999 |
|---|
| 3 | EE | A. Volgenant,
E. Teerhuis:
Improved heuristics for the n-job single-machine weighted tardiness problem.
Computers & OR 26(1): 35-44 (1999) |
| 1996 |
|---|
| 2 | EE | A. Volgenant:
Linear and semi-assignment problems: A core oriented approach.
Computers & OR 23(10): 917-932 (1996) |
| 1 | EE | A. Volgenant:
An addendum to the most vital edges of matching in a bipartite graph.
Networks 27(4): 253 (1996) |
