default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. Volgenant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j41]C. W. Duin, A. Volgenant:
On weighting two criteria with a parameter in combinatorial optimization problems. Eur. J. Oper. Res. 221(1): 1-6 (2012)- 2011
- [j40]M. C. Janssen, R. J. D. Verbeek, A. Volgenant:
On scheduling a single machine with resource dependent release times. Comput. Oper. Res. 38(3): 713-716 (2011) - 2010
- [j39]J. Bijsterbosch, A. Volgenant:
Solving the Rectangular assignment problem and applications. Ann. Oper. Res. 181(1): 443-462 (2010) - [j38]A. Volgenant, C. W. Duin:
On a pair of job-machine assignment problems with two stages. Comput. Oper. Res. 37(2): 334-340 (2010) - [j37]A. Volgenant, C. W. Duin:
Improved polynomial algorithms for robust bottleneck problems with interval data. Comput. Oper. Res. 37(5): 909-915 (2010) - [j36]M. Mekking, A. Volgenant:
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound. Eur. J. Oper. Res. 203(1): 50-58 (2010)
2000 – 2009
- 2008
- [j35]A. Volgenant:
Technical Note - A Note on Parametric Analysis in Linear Assignment. Oper. Res. 56(2): 519-522 (2008) - [j34]A. Volgenant:
An addendum on the incremental assignment problem. Inf. Sci. 178(23): 4583 (2008) - 2007
- [j33]P. M. D. Lieshout, A. Volgenant:
A branch-and-bound algorithm for the singly constrained assignment problem. Eur. J. Oper. Res. 176(1): 151-164 (2007) - [j32]A. Volgenant, I. Y. Zwiers:
Partial enumeration in heuristics for some combinatorial optimization problems. J. Oper. Res. Soc. 58(1): 73-79 (2007) - 2006
- [j31]Peter Korteweg, Ton Volgenant:
On the Hierarchical Chinese Postman Problem with linear ordered classes. Eur. J. Oper. Res. 169(1): 41-52 (2006) - [j30]A. Volgenant:
An addendum on sensitivity analysis of the optimal assignment. Eur. J. Oper. Res. 169(1): 338-339 (2006) - [j29]C. W. Duin, A. Volgenant:
Some inverse optimization problems under the Hamming distance. Eur. J. Oper. Res. 170(3): 887-899 (2006) - [j28]A. Volgenant, A. de Waal:
A heuristic for multiple-feeder PCB manufacturing. J. Oper. Res. Soc. 57(9): 1134-1141 (2006) - 2005
- [j27]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
- [j26]A. Teeninga, A. Volgenant:
Improved heuristics for the traveling purchaser problem. Comput. Oper. Res. 31(1): 139-150 (2004) - [j25]C. W. Duin, A. Volgenant, Stefan Voß
:
Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154(1): 323-329 (2004) - [j24]A. Volgenant:
A note on the assignment problem with seniority and job priority constraints. Eur. J. Oper. Res. 154(1): 330-335 (2004) - [j23]A. Volgenant:
Solving the k. Eur. J. Oper. Res. 157(2): 322-331 (2004) - [j22]A. Volgenant, C. W. Duin:
On Steiner Versions of (bi)Connectivity in Network Problems. Graphs Comb. 20(2): 263-273 (2004) - 2002
- [j21]A. Volgenant:
Solving some lexicographic multi-objective combinatorial problems. Eur. J. Oper. Res. 139(3): 578-584 (2002) - 2000
- [j20]A. Volgenant:
A note on splitting of variables in integer programming models. Eur. J. Oper. Res. 122(1): 166-172 (2000) - [j19]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): 526-534 (2000)
1990 – 1999
- 1999
- [j18]A. Volgenant, E. Teerhuis:
Improved heuristics for the n-job single-machine weighted tardiness problem. Comput. Oper. Res. 26(1): 35-44 (1999) - [j17]Roy Jonker, A. Volgenant:
Linear assignment procedures. Eur. J. Oper. Res. 116(1): 233-234 (1999) - [j16]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): 283 (1999) - 1998
- [j15]A. Volgenant, S. Marsman:
A core approach to the 0-1 equality knapsack problem. J. Oper. Res. Soc. 49(1): 86-92 (1998) - 1996
- [j14]A. Volgenant:
Linear and semi-assignment problems: A core oriented approach. Comput. Oper. Res. 23(10): 917-932 (1996) - [j13]A. Volgenant:
An addendum to the most vital edges of matching in a bipartite graph. Networks 27(4): 253 (1996) - 1991
- [j12]Cees Duin, Ton Volgenant:
The multi-weighted Steiner tree problem. Ann. Oper. Res. 33(6): 451-469 (1991) - [j11]C. W. Duin, A. Volgenant:
Minimum deviation and balanced optimization: A unified approach. Oper. Res. Lett. 10(1): 43-48 (1991) - 1990
- [j10]Ton Volgenant, Roy Jonker:
Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem. Comput. Oper. Res. 17(1): 113-117 (1990)
1980 – 1989
- 1989
- [j9]C. W. Duin, A. Volgenant:
Reduction tests for the steiner problem in grapsh. Networks 19(5): 549-567 (1989) - 1988
- [j8]Roy Jonker, Ton Volgenant:
Technical Note - An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem. Oper. Res. 36(1): 163-167 (1988) - 1987
- [j7]Roy Jonker, A. Volgenant:
A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4): 325-340 (1987) - [j6]C. W. Duin, A. Volgenant:
Some generalizations of the steiner problem in graphs. Networks 17(3): 353-364 (1987) - 1985
- [j5]Martin W. P. Savelsbergh, Ton Volgenant:
Edge exchanges in the degree-constrained minimum spanning tree problem. Comput. Oper. Res. 12(4): 341-348 (1985) - 1984
- [j4]Roy Jonker, Ton Volgenant:
Nonoptimal Edges for the Symmetric Traveling Salesman Problem. Oper. Res. 32(4): 837-846 (1984) - 1982
- [j3]Roy Jonker, Ton Volgenant:
Identification of non-optimal arcs for the travelling salesman problem. Oper. Res. Lett. 1(3): 85-88 (1982) - 1980
- [j2]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): 623-627 (1980) - [j1]Roy Jonker, Rob Kaas, Ton Volgenant:
Technical Note - Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit. Oper. Res. 28(5): 1219-1222 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
