A. Volgenant

According to our database, A. Volgenant authored at least 41 papers between 1980 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2012

On weighting two criteria with a parameter in combinatorial optimization problems.

C. W. Duin, A. Volgenant

Eur. J. Oper. Res., 2012

2011

On scheduling a single machine with resource dependent release times.

M. C. Janssen, R. J. D. Verbeek, A. Volgenant

Comput. Oper. Res., 2011

2010

Solving the 2-rooted mini-max spanning forest problem by branch-and-bound.

M. Mekking, A. Volgenant

Eur. J. Oper. Res., 2010

Improved polynomial algorithms for robust bottleneck problems with interval data.

A. Volgenant, C. W. Duin

Comput. Oper. Res., 2010

On a pair of job-machine assignment problems with two stages.

A. Volgenant, C. W. Duin

Comput. Oper. Res., 2010

Solving the Rectangular assignment problem and applications.

J. Bijsterbosch, A. Volgenant

Ann. Oper. Res., 2010

2008

An addendum on the incremental assignment problem.

A. Volgenant

Inf. Sci., 2008

Technical Note - A Note on Parametric Analysis in Linear Assignment.

A. Volgenant

Oper. Res., 2008

2007

Partial enumeration in heuristics for some combinatorial optimization problems.

A. Volgenant, I. Y. Zwiers

J. Oper. Res. Soc., 2007

A branch-and-bound algorithm for the singly constrained assignment problem.

P. M. D. Lieshout, A. Volgenant

Eur. J. Oper. Res., 2007

2006

A heuristic for multiple-feeder PCB manufacturing.

A. Volgenant, A. de Waal

J. Oper. Res. Soc., 2006

An addendum on sensitivity analysis of the optimal assignment.

A. Volgenant

Eur. J. Oper. Res., 2006

On the Hierarchical Chinese Postman Problem with linear ordered classes.

Peter Korteweg, Ton Volgenant

Eur. J. Oper. Res., 2006

Some inverse optimization problems under the Hamming distance.

C. W. Duin, A. Volgenant

Eur. J. Oper. Res., 2006

2005

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.

A. Volgenant

Oper. Res. Lett., 2005

2004

On Steiner Versions of (bi)Connectivity in Network Problems.

A. Volgenant, C. W. Duin

Graphs Comb., 2004

A note on the assignment problem with seniority and job priority constraints.

A. Volgenant

Eur. J. Oper. Res., 2004

Solving the k.

A. Volgenant

Eur. J. Oper. Res., 2004

Solving group Steiner problems as Steiner problems.

C. W. Duin, A. Volgenant, Stefan Voß

Eur. J. Oper. Res., 2004

Improved heuristics for the traveling purchaser problem.

A. Teeninga, A. Volgenant

Comput. Oper. Res., 2004

2002

Solving some lexicographic multi-objective combinatorial problems.

A. Volgenant

Eur. J. Oper. Res., 2002

2000

A note on splitting of variables in integer programming models.

A. Volgenant

Eur. J. Oper. Res., 2000

The dynamic predicate stashing copy problem and the Steiner problem in graphs.

S. Marsman, C. W. Duin, A. Volgenant

Eur. J. Oper. Res., 2000

1999

Comments on 'Fast heuristics for protection networks for dynamic routing' (Ouveysi and Wirth) - JORS 50: pp 262-267.

A. Volgenant

J. Oper. Res. Soc., 1999

Linear assignment procedures.

Roy Jonker, A. Volgenant

Eur. J. Oper. Res., 1999

Improved heuristics for the n-job single-machine weighted tardiness problem.

A. Volgenant, E. Teerhuis

Comput. Oper. Res., 1999

1998

A core approach to the 0-1 equality knapsack problem.

A. Volgenant, S. Marsman

J. Oper. Res. Soc., 1998

1996

An addendum to the most vital edges of matching in a bipartite graph.

A. Volgenant

Networks, 1996

Linear and semi-assignment problems: A core oriented approach.

A. Volgenant

Comput. Oper. Res., 1996

1991

Minimum deviation and balanced optimization: A unified approach.

C. W. Duin, A. Volgenant

Oper. Res. Lett., 1991

The multi-weighted Steiner tree problem.

Cees Duin, Ton Volgenant

Ann. Oper. Res., 1991

1990

Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem.

Ton Volgenant, Roy Jonker

Comput. Oper. Res., 1990

1989

Reduction tests for the steiner problem in grapsh.

C. W. Duin, A. Volgenant

Networks, 1989

1988

Technical Note - An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem.

Roy Jonker, Ton Volgenant

Oper. Res., 1988

1987

Some generalizations of the steiner problem in graphs.

C. W. Duin, A. Volgenant

Networks, 1987

A shortest augmenting path algorithm for dense and sparse linear assignment problems.

Roy Jonker, A. Volgenant

Computing, 1987

1985

Edge exchanges in the degree-constrained minimum spanning tree problem.

Martin W. P. Savelsbergh, Ton Volgenant

Comput. Oper. Res., 1985

1984

Nonoptimal Edges for the Symmetric Traveling Salesman Problem.

Roy Jonker, Ton Volgenant

Oper. Res., 1984

1982

Identification of non-optimal arcs for the travelling salesman problem.

Roy Jonker, Ton Volgenant

Oper. Res. Lett., 1982

1980

Technical Note - Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem.

Roy Jonker, G. De Leve, J. A. Van Der Velde, A. Volgenant

Oper. Res., 1980

Technical Note - Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit.

Roy Jonker, Rob Kaas, Ton Volgenant

Oper. Res., 1980