A. Volgenant

Publication Activity (10 Years)

Years Active: 1980-2012
Publications (10 Years): 0

Top Topics

Parameter Space

Job Shop Scheduling

Combinatorial Optimization

Top Venues

Eur. J. Oper. Res.

Publications

C. W. Duin, A. Volgenant
On weighting two criteria with a parameter in combinatorial optimization problems. Eur. J. Oper. Res. 221 (1) (2012)
M. C. Janssen, R. J. D. Verbeek, A. Volgenant
On scheduling a single machine with resource dependent release times. Comput. Oper. Res. 38 (3) (2011)
A. Volgenant, C. W. Duin
Improved polynomial algorithms for robust bottleneck problems with interval data. Comput. Oper. Res. 37 (5) (2010)
J. Bijsterbosch, A. Volgenant
Solving the Rectangular assignment problem and applications. Ann. Oper. Res. 181 (1) (2010)
A. Volgenant, C. W. Duin
On a pair of job-machine assignment problems with two stages. Comput. Oper. Res. 37 (2) (2010)
M. Mekking, A. Volgenant
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound. Eur. J. Oper. Res. 203 (1) (2010)
A. Volgenant
Technical Note - A Note on Parametric Analysis in Linear Assignment. Oper. Res. 56 (2) (2008)
A. Volgenant
An addendum on the incremental assignment problem. Inf. Sci. 178 (23) (2008)
P. M. D. Lieshout, A. Volgenant
A branch-and-bound algorithm for the singly constrained assignment problem. Eur. J. Oper. Res. 176 (1) (2007)
A. Volgenant, I. Y. Zwiers
Partial enumeration in heuristics for some combinatorial optimization problems. J. Oper. Res. Soc. 58 (1) (2007)
A. Volgenant, A. de Waal
A heuristic for multiple-feeder PCB manufacturing. J. Oper. Res. Soc. 57 (9) (2006)
A. Volgenant
An addendum on sensitivity analysis of the optimal assignment. Eur. J. Oper. Res. 169 (1) (2006)
C. W. Duin, A. Volgenant
Some inverse optimization problems under the Hamming distance. Eur. J. Oper. Res. 170 (3) (2006)
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) (2005)
A. Volgenant
Solving the k. Eur. J. Oper. Res. 157 (2) (2004)
A. Volgenant
A note on the assignment problem with seniority and job priority constraints. Eur. J. Oper. Res. 154 (1) (2004)
A. Teeninga, A. Volgenant
Improved heuristics for the traveling purchaser problem. Comput. Oper. Res. 31 (1) (2004)
C. W. Duin, A. Volgenant, Stefan Voß
Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154 (1) (2004)
A. Volgenant, C. W. Duin
On Steiner Versions of (bi)Connectivity in Network Problems. Graphs Comb. 20 (2) (2004)
A. Volgenant
Solving some lexicographic multi-objective combinatorial problems. Eur. J. Oper. Res. 139 (3) (2002)
A. Volgenant
A note on splitting of variables in integer programming models. Eur. J. Oper. Res. 122 (1) (2000)
S. Marsman, C. W. Duin, A. Volgenant
The dynamic predicate stashing copy problem and the Steiner problem in graphs. Eur. J. Oper. Res. 125 (3) (2000)
A. Volgenant, E. Teerhuis
Improved heuristics for the n-job single-machine weighted tardiness problem. Comput. Oper. Res. 26 (1) (1999)
Roy Jonker, A. Volgenant
Linear assignment procedures. Eur. J. Oper. Res. 116 (1) (1999)
A. Volgenant
Comments on 'Fast heuristics for protection networks for dynamic routing' (Ouveysi and Wirth) - JORS 50: pp 262-267. J. Oper. Res. Soc. 50 (3) (1999)
A. Volgenant, S. Marsman
A core approach to the 0-1 equality knapsack problem. J. Oper. Res. Soc. 49 (1) (1998)
A. Volgenant
An addendum to the most vital edges of matching in a bipartite graph. Networks 27 (4) (1996)
A. Volgenant
Linear and semi-assignment problems: A core oriented approach. Comput. Oper. Res. 23 (10) (1996)
C. W. Duin, A. Volgenant
Minimum deviation and balanced optimization: A unified approach. Oper. Res. Lett. 10 (1) (1991)
C. W. Duin, A. Volgenant
Reduction tests for the steiner problem in grapsh. Networks 19 (5) (1989)
C. W. Duin, A. Volgenant
Some generalizations of the steiner problem in graphs. Networks 17 (3) (1987)
Roy Jonker, A. Volgenant
A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38 (4) (1987)
Roy Jonker, G. De Leve, J. A. Van Der Velde, A. Volgenant
Technical Note - Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem. Oper. Res. 28 (3-Part-I) (1980)