A. Volgenant

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