BibTeX records: A. Volgenant

download as .bib file

@article{DBLP:journals/eor/DuinV12,
  author    = {C. W. Duin and
               A. Volgenant},
  title     = {On weighting two criteria with a parameter in combinatorial optimization
               problems},
  journal   = {European Journal of Operational Research},
  volume    = {221},
  number    = {1},
  pages     = {1--6},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.ejor.2012.01.054},
  doi       = {10.1016/j.ejor.2012.01.054},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/DuinV12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/JanssenVV11,
  author    = {M. C. Janssen and
               R. J. D. Verbeek and
               A. Volgenant},
  title     = {On scheduling a single machine with resource dependent release times},
  journal   = {Computers {\&} {OR}},
  volume    = {38},
  number    = {3},
  pages     = {713--716},
  year      = {2011},
  url       = {https://doi.org/10.1016/j.cor.2010.08.013},
  doi       = {10.1016/j.cor.2010.08.013},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/JanssenVV11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BijsterboschV10,
  author    = {J. Bijsterbosch and
               A. Volgenant},
  title     = {Solving the Rectangular assignment problem and applications},
  journal   = {Annals {OR}},
  volume    = {181},
  number    = {1},
  pages     = {443--462},
  year      = {2010},
  url       = {https://doi.org/10.1007/s10479-010-0757-3},
  doi       = {10.1007/s10479-010-0757-3},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/anor/BijsterboschV10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/VolgenantD10,
  author    = {A. Volgenant and
               C. W. Duin},
  title     = {On a pair of job-machine assignment problems with two stages},
  journal   = {Computers {\&} {OR}},
  volume    = {37},
  number    = {2},
  pages     = {334--340},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.cor.2009.05.009},
  doi       = {10.1016/j.cor.2009.05.009},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/VolgenantD10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/VolgenantD10a,
  author    = {A. Volgenant and
               C. W. Duin},
  title     = {Improved polynomial algorithms for robust bottleneck problems with
               interval data},
  journal   = {Computers {\&} {OR}},
  volume    = {37},
  number    = {5},
  pages     = {909--915},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.cor.2009.03.013},
  doi       = {10.1016/j.cor.2009.03.013},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/VolgenantD10a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MekkingV10,
  author    = {M. Mekking and
               A. Volgenant},
  title     = {Solving the 2-rooted mini-max spanning forest problem by branch-and-bound},
  journal   = {European Journal of Operational Research},
  volume    = {203},
  number    = {1},
  pages     = {50--58},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.ejor.2009.07.038},
  doi       = {10.1016/j.ejor.2009.07.038},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/MekkingV10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Volgenant08,
  author    = {A. Volgenant},
  title     = {Technical Note - {A} Note on Parametric Analysis in Linear Assignment},
  journal   = {Operations Research},
  volume    = {56},
  number    = {2},
  pages     = {519--522},
  year      = {2008},
  url       = {https://doi.org/10.1287/opre.1070.0470},
  doi       = {10.1287/opre.1070.0470},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ior/Volgenant08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/Volgenant08,
  author    = {A. Volgenant},
  title     = {An addendum on the incremental assignment problem},
  journal   = {Inf. Sci.},
  volume    = {178},
  number    = {23},
  pages     = {4583},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.ins.2008.07.020},
  doi       = {10.1016/j.ins.2008.07.020},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/isci/Volgenant08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LieshoutV07,
  author    = {P. M. D. Lieshout and
               A. Volgenant},
  title     = {A branch-and-bound algorithm for the singly constrained assignment
               problem},
  journal   = {European Journal of Operational Research},
  volume    = {176},
  number    = {1},
  pages     = {151--164},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.ejor.2005.05.028},
  doi       = {10.1016/j.ejor.2005.05.028},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/LieshoutV07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/VolgenantZ07,
  author    = {A. Volgenant and
               I. Y. Zwiers},
  title     = {Partial enumeration in heuristics for some combinatorial optimization
               problems},
  journal   = {{JORS}},
  volume    = {58},
  number    = {1},
  pages     = {73--79},
  year      = {2007},
  url       = {https://doi.org/10.1057/palgrave.jors.2602102},
  doi       = {10.1057/palgrave.jors.2602102},
  timestamp = {Wed, 20 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jors/VolgenantZ07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KortewegV06,
  author    = {Peter Korteweg and
               Ton Volgenant},
  title     = {On the Hierarchical Chinese Postman Problem with linear ordered classes},
  journal   = {European Journal of Operational Research},
  volume    = {169},
  number    = {1},
  pages     = {41--52},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.ejor.2004.06.003},
  doi       = {10.1016/j.ejor.2004.06.003},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/KortewegV06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Volgenant06,
  author    = {A. Volgenant},
  title     = {An addendum on sensitivity analysis of the optimal assignment},
  journal   = {European Journal of Operational Research},
  volume    = {169},
  number    = {1},
  pages     = {338--339},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.ejor.2004.09.015},
  doi       = {10.1016/j.ejor.2004.09.015},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/Volgenant06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DuinV06,
  author    = {C. W. Duin and
               A. Volgenant},
  title     = {Some inverse optimization problems under the Hamming distance},
  journal   = {European Journal of Operational Research},
  volume    = {170},
  number    = {3},
  pages     = {887--899},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.ejor.2004.07.059},
  doi       = {10.1016/j.ejor.2004.07.059},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/DuinV06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/VolgenantW06,
  author    = {A. Volgenant and
               A. de Waal},
  title     = {A heuristic for multiple-feeder {PCB} manufacturing},
  journal   = {{JORS}},
  volume    = {57},
  number    = {9},
  pages     = {1134--1141},
  year      = {2006},
  url       = {https://doi.org/10.1057/palgrave.jors.2602086},
  doi       = {10.1057/palgrave.jors.2602086},
  timestamp = {Fri, 22 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jors/VolgenantW06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Volgenant05,
  author    = {A. Volgenant},
  title     = {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},
  journal   = {Oper. Res. Lett.},
  volume    = {33},
  number    = {2},
  pages     = {216--217},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.orl.2004.07.001},
  doi       = {10.1016/j.orl.2004.07.001},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/orl/Volgenant05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/TeeningaV04,
  author    = {A. Teeninga and
               A. Volgenant},
  title     = {Improved heuristics for the traveling purchaser problem},
  journal   = {Computers {\&} {OR}},
  volume    = {31},
  number    = {1},
  pages     = {139--150},
  year      = {2004},
  url       = {https://doi.org/10.1016/S0305-0548(02)00193-4},
  doi       = {10.1016/S0305-0548(02)00193-4},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/TeeningaV04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DuinVV04,
  author    = {C. W. Duin and
               A. Volgenant and
               Stefan Vo{\ss}},
  title     = {Solving group Steiner problems as Steiner problems},
  journal   = {European Journal of Operational Research},
  volume    = {154},
  number    = {1},
  pages     = {323--329},
  year      = {2004},
  url       = {https://doi.org/10.1016/S0377-2217(02)00707-5},
  doi       = {10.1016/S0377-2217(02)00707-5},
  timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/DuinVV04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Volgenant04a,
  author    = {A. Volgenant},
  title     = {A note on the assignment problem with seniority and job priority constraints},
  journal   = {European Journal of Operational Research},
  volume    = {154},
  number    = {1},
  pages     = {330--335},
  year      = {2004},
  url       = {https://doi.org/10.1016/S0377-2217(03)00090-0},
  doi       = {10.1016/S0377-2217(03)00090-0},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/Volgenant04a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Volgenant04,
  author    = {A. Volgenant},
  title     = {Solving the k},
  journal   = {European Journal of Operational Research},
  volume    = {157},
  number    = {2},
  pages     = {322--331},
  year      = {2004},
  url       = {https://doi.org/10.1016/S0377-2217(03)00205-4},
  doi       = {10.1016/S0377-2217(03)00205-4},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/Volgenant04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/VolgenantD04,
  author    = {A. Volgenant and
               C. W. Duin},
  title     = {On Steiner Versions of (bi)Connectivity in Network Problems},
  journal   = {Graphs and Combinatorics},
  volume    = {20},
  number    = {2},
  pages     = {263--273},
  year      = {2004},
  url       = {https://doi.org/10.1007/s00373-004-0554-3},
  doi       = {10.1007/s00373-004-0554-3},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/VolgenantD04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Volgenant02,
  author    = {A. Volgenant},
  title     = {Solving some lexicographic multi-objective combinatorial problems},
  journal   = {European Journal of Operational Research},
  volume    = {139},
  number    = {3},
  pages     = {578--584},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0377-2217(01)00214-4},
  doi       = {10.1016/S0377-2217(01)00214-4},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/Volgenant02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Volgenant00,
  author    = {A. Volgenant},
  title     = {A note on splitting of variables in integer programming models},
  journal   = {European Journal of Operational Research},
  volume    = {122},
  number    = {1},
  pages     = {166--172},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0377-2217(99)00065-X},
  doi       = {10.1016/S0377-2217(99)00065-X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/Volgenant00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MarsmanDV00,
  author    = {S. Marsman and
               C. W. Duin and
               A. Volgenant},
  title     = {The dynamic predicate stashing copy problem and the Steiner problem
               in graphs},
  journal   = {European Journal of Operational Research},
  volume    = {125},
  number    = {3},
  pages     = {526--534},
  year      = {2000},
  url       = {https://doi.org/10.1016/S0377-2217(99)00223-4},
  doi       = {10.1016/S0377-2217(99)00223-4},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/MarsmanDV00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/VolgenantT99,
  author    = {A. Volgenant and
               E. Teerhuis},
  title     = {Improved heuristics for the n-job single-machine weighted tardiness
               problem},
  journal   = {Computers {\&} {OR}},
  volume    = {26},
  number    = {1},
  pages     = {35--44},
  year      = {1999},
  url       = {https://doi.org/10.1016/S0305-0548(98)00048-3},
  doi       = {10.1016/S0305-0548(98)00048-3},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/VolgenantT99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/JonkerV99,
  author    = {Roy Jonker and
               A. Volgenant},
  title     = {Linear assignment procedures},
  journal   = {European Journal of Operational Research},
  volume    = {116},
  number    = {1},
  pages     = {233--234},
  year      = {1999},
  url       = {https://doi.org/10.1016/S0377-2217(98)00361-0},
  doi       = {10.1016/S0377-2217(98)00361-0},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/JonkerV99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Volgenant96,
  author    = {A. Volgenant},
  title     = {Linear and semi-assignment problems: {A} core oriented approach},
  journal   = {Computers {\&} {OR}},
  volume    = {23},
  number    = {10},
  pages     = {917--932},
  year      = {1996},
  url       = {https://doi.org/10.1016/0305-0548(96)00010-X},
  doi       = {10.1016/0305-0548(96)00010-X},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/Volgenant96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Volgenant96,
  author    = {A. Volgenant},
  title     = {An addendum to the most vital edges of matching in a bipartite graph},
  journal   = {Networks},
  volume    = {27},
  number    = {4},
  pages     = {253},
  year      = {1996},
  url       = {https://doi.org/10.1002/(SICI)1097-0037(199605)27:3\&\#60;253::AID-NET9\&\#62;3.0.CO;2-H},
  doi       = {10.1002/(SICI)1097-0037(199605)27:3\&\#60;253::AID-NET9\&\#62;3.0.CO;2-H},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/networks/Volgenant96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/DuinV91,
  author    = {Cees Duin and
               Ton Volgenant},
  title     = {The multi-weighted Steiner tree problem},
  journal   = {Annals {OR}},
  volume    = {33},
  number    = {6},
  pages     = {451--469},
  year      = {1991},
  url       = {https://doi.org/10.1007/BF02071982},
  doi       = {10.1007/BF02071982},
  timestamp = {Mon, 21 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/anor/DuinV91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DuinV91,
  author    = {C. W. Duin and
               A. Volgenant},
  title     = {Minimum deviation and balanced optimization: {A} unified approach},
  journal   = {Oper. Res. Lett.},
  volume    = {10},
  number    = {1},
  pages     = {43--48},
  year      = {1991},
  url       = {https://doi.org/10.1016/0167-6377(91)90085-4},
  doi       = {10.1016/0167-6377(91)90085-4},
  timestamp = {Fri, 31 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/orl/DuinV91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/VolgenantJ90,
  author    = {Ton Volgenant and
               Roy Jonker},
  title     = {Fictitious upper bounds in an algorithm for the symmetric traveling
               salesman problem},
  journal   = {Computers {\&} {OR}},
  volume    = {17},
  number    = {1},
  pages     = {113--117},
  year      = {1990},
  url       = {https://doi.org/10.1016/0305-0548(90)90034-5},
  doi       = {10.1016/0305-0548(90)90034-5},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/VolgenantJ90},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DuinV89,
  author    = {C. W. Duin and
               A. Volgenant},
  title     = {Reduction tests for the steiner problem in grapsh},
  journal   = {Networks},
  volume    = {19},
  number    = {5},
  pages     = {549--567},
  year      = {1989},
  url       = {https://doi.org/10.1002/net.3230190506},
  doi       = {10.1002/net.3230190506},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/networks/DuinV89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/JonkerV88,
  author    = {Roy Jonker and
               Ton Volgenant},
  title     = {Technical Note - An Improved Transformation of the Symmetric Multiple
               Traveling Salesman Problem},
  journal   = {Operations Research},
  volume    = {36},
  number    = {1},
  pages     = {163--167},
  year      = {1988},
  url       = {https://doi.org/10.1287/opre.36.1.163},
  doi       = {10.1287/opre.36.1.163},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ior/JonkerV88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/JonkerV87,
  author    = {Roy Jonker and
               A. Volgenant},
  title     = {A shortest augmenting path algorithm for dense and sparse linear assignment
               problems},
  journal   = {Computing},
  volume    = {38},
  number    = {4},
  pages     = {325--340},
  year      = {1987},
  url       = {https://doi.org/10.1007/BF02278710},
  doi       = {10.1007/BF02278710},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/computing/JonkerV87},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DuinV87,
  author    = {C. W. Duin and
               A. Volgenant},
  title     = {Some generalizations of the steiner problem in graphs},
  journal   = {Networks},
  volume    = {17},
  number    = {3},
  pages     = {353--364},
  year      = {1987},
  url       = {https://doi.org/10.1002/net.3230170309},
  doi       = {10.1002/net.3230170309},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/networks/DuinV87},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/SavelsberghV85,
  author    = {Martin W. P. Savelsbergh and
               Ton Volgenant},
  title     = {Edge exchanges in the degree-constrained minimum spanning tree problem},
  journal   = {Computers {\&} {OR}},
  volume    = {12},
  number    = {4},
  pages     = {341--348},
  year      = {1985},
  url       = {https://doi.org/10.1016/0305-0548(85)90032-2},
  doi       = {10.1016/0305-0548(85)90032-2},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cor/SavelsberghV85},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/JonkerV84,
  author    = {Roy Jonker and
               Ton Volgenant},
  title     = {Nonoptimal Edges for the Symmetric Traveling Salesman Problem},
  journal   = {Operations Research},
  volume    = {32},
  number    = {4},
  pages     = {837--846},
  year      = {1984},
  url       = {https://doi.org/10.1287/opre.32.4.837},
  doi       = {10.1287/opre.32.4.837},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ior/JonkerV84},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/JonkerV82,
  author    = {Roy Jonker and
               Ton Volgenant},
  title     = {Identification of non-optimal arcs for the travelling salesman problem},
  journal   = {Oper. Res. Lett.},
  volume    = {1},
  number    = {3},
  pages     = {85--88},
  year      = {1982},
  url       = {https://doi.org/10.1016/0167-6377(82)90002-5},
  doi       = {10.1016/0167-6377(82)90002-5},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/orl/JonkerV82},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/JonkerLVV80,
  author    = {Roy Jonker and
               G. De Leve and
               J. A. Van Der Velde and
               A. Volgenant},
  title     = {Technical Note - Rounding Symmetric Traveling Salesman Problems with
               an Asymmetric Assignment Problem},
  journal   = {Operations Research},
  volume    = {28},
  number    = {3-Part-I},
  pages     = {623--627},
  year      = {1980},
  url       = {https://doi.org/10.1287/opre.28.3.623},
  doi       = {10.1287/opre.28.3.623},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ior/JonkerLVV80},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/JonkerKV80,
  author    = {Roy Jonker and
               Rob Kaas and
               Ton Volgenant},
  title     = {Technical Note - Data-Dependent Bounds for Heuristics to Find a Minimum
               Weight Hamiltonian Circuit},
  journal   = {Operations Research},
  volume    = {28},
  number    = {5},
  pages     = {1219--1222},
  year      = {1980},
  url       = {https://doi.org/10.1287/opre.28.5.1219},
  doi       = {10.1287/opre.28.5.1219},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ior/JonkerKV80},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics