default search action

combined dblp search
author search
venue search
publication search

ask others

Search dblp for Publications

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

export results for "toc:db/journals/disopt/disopt3.bht:"

> Home > Search

download as .bib file

@article{DBLP:journals/disopt/AgraC06,
  author       = {Agostinho Agra and
                  Miguel Fragoso Constantino},
  title        = {Description of 2-integer continuous knapsack polyhedra},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {2},
  pages        = {95--110},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.008},
  doi          = {10.1016/J.DISOPT.2005.10.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/AgraC06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/AlfieriNP06,
  author       = {Arianna Alfieri and
                  Gaia Nicosia and
                  Andrea Pacifici},
  title        = {Exact algorithms for a discrete metric labeling problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {181--194},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.009},
  doi          = {10.1016/J.DISOPT.2006.05.009},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/AlfieriNP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BaiouC06,
  author       = {Mourad Ba{\"{\i}}ou and
                  Jos{\'{e}} R. Correa},
  title        = {The node-edge weighted 2-edge connected subgraph problem: Linear relaxation,
                  facets and separation},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {2},
  pages        = {123--135},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.08.010},
  doi          = {10.1016/J.DISOPT.2005.08.010},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BaiouC06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BalasCFS06,
  author       = {Egon Balas and
                  Robert D. Carr and
                  Matteo Fischetti and
                  Neil Simonetti},
  title        = {New facets of the {STS} polytope generated from known facets of the
                  {ATS} polytope},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {3--19},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.001},
  doi          = {10.1016/J.DISOPT.2005.10.001},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/BalasCFS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Bang-JensenGY06,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Gregory Z. Gutin and
                  Anders Yeo},
  title        = {Finding cheapest cycles in vertex-weighted quasi-transitive and extended
                  semicomplete digraphs},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {86--94},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.11.001},
  doi          = {10.1016/J.DISOPT.2005.11.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Bang-JensenGY06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Bar-YehudaR06,
  author       = {Reuven Bar{-}Yehuda and
                  Dror Rawitz},
  title        = {Using fractional primal-dual to schedule split intervals with demands},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {275--287},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.010},
  doi          = {10.1016/J.DISOPT.2006.05.010},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Bar-YehudaR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BarthBDF06,
  author       = {Dominique Barth and
                  Pascal Berthom{\'{e}} and
                  Madiagne Diallo and
                  Afonso Ferreira},
  title        = {Revisiting parametric multi-terminal problems: Maximum flows, minimum
                  cuts and cut-tree computations},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {195--205},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.003},
  doi          = {10.1016/J.DISOPT.2006.05.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BarthBDF06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BendallM06,
  author       = {Gareth Bendall and
                  Fran{\c{c}}ois Margot},
  title        = {Minimum number of below average triangles in a weighted complete graph},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {206--219},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.004},
  doi          = {10.1016/J.DISOPT.2006.05.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BendallM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BendallM06a,
  author       = {Gareth Bendall and
                  Fran{\c{c}}ois Margot},
  title        = {Greedy-type resistance of combinatorial problems},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {288--298},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.03.001},
  doi          = {10.1016/J.DISOPT.2006.03.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BendallM06a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BetzlerNU06,
  author       = {Nadja Betzler and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Tree decompositions of graphs: Saving memory in dynamic programming},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {220--229},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.008},
  doi          = {10.1016/J.DISOPT.2006.05.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BetzlerNU06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BompadreDO06,
  author       = {Agust{\'{\i}}n Bompadre and
                  Moshe Dror and
                  James B. Orlin},
  title        = {Improved bounds for vehicle routing solutions},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {299--316},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.04.002},
  doi          = {10.1016/J.DISOPT.2006.04.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BompadreDO06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/CapraraLMM06,
  author       = {Alberto Caprara and
                  Andrea Lodi and
                  Silvano Martello and
                  Michele Monaci},
  title        = {Packing into the smallest square: Worst-case analysis of lower bounds},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {317--326},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.06.001},
  doi          = {10.1016/J.DISOPT.2006.06.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/CapraraLMM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Cheung06,
  author       = {Kevin K. H. Cheung},
  title        = {Facets of the independent path-matching polytope},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {2},
  pages        = {111--122},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.01.001},
  doi          = {10.1016/J.DISOPT.2006.01.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Cheung06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/DoiF06,
  author       = {Takashi Doi and
                  Toshihiro Fujito},
  title        = {A primal-dual method for approximating tree cover with two weights},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {230--237},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.005},
  doi          = {10.1016/J.DISOPT.2006.05.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/DoiF06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/ErdoganT06,
  author       = {G{\"{u}}nes Erdogan and
                  Barbaros {\c{C}}. Tansel},
  title        = {A note on a polynomial time solvable case of the quadratic assignment
                  problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {382--384},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.04.001},
  doi          = {10.1016/J.DISOPT.2006.04.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/ErdoganT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/ErgunO06,
  author       = {{\"{O}}zlem Ergun and
                  James B. Orlin},
  title        = {A dynamic programming methodology in very large scale neighborhood
                  search applied to the traveling salesman problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {78--85},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.002},
  doi          = {10.1016/J.DISOPT.2005.10.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/ErgunO06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/FaigleLMP06,
  author       = {Ulrich Faigle and
                  Leo Liberti and
                  Francesco Maffioli and
                  Stefan Pickl},
  title        = {Graphs and combinatorial optimization},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {179},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.001},
  doi          = {10.1016/J.DISOPT.2006.05.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/FaigleLMP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Fiorini06,
  author       = {Samuel Fiorini},
  title        = {How to recycle your facets},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {2},
  pages        = {136--153},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.007},
  doi          = {10.1016/J.DISOPT.2005.10.007},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Fiorini06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/GrigorievK06,
  author       = {Alexander Grigoriev and
                  Joris van de Klundert},
  title        = {On the high multiplicity traveling salesman problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {50--62},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.11.002},
  doi          = {10.1016/J.DISOPT.2005.11.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/GrigorievK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/GutinP06,
  author       = {Gregory Z. Gutin and
                  Abraham P. Punnen},
  title        = {The traveling salesman problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {1},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.12.001},
  doi          = {10.1016/J.DISOPT.2005.12.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/GutinP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/HamacherRT06,
  author       = {Horst W. Hamacher and
                  Stefan Ruzika and
                  Stevanus A. Tjandra},
  title        = {Algorithms for time-dependent bicriteria shortest path problems},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {238--254},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.006},
  doi          = {10.1016/J.DISOPT.2006.05.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/HamacherRT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/HochbaumL06,
  author       = {Dorit S. Hochbaum and
                  Asaf Levin},
  title        = {Cyclical scheduling and multi-shift scheduling: Complexity and approximation
                  algorithms},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {327--340},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.02.002},
  doi          = {10.1016/J.DISOPT.2006.02.002},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/HochbaumL06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/IshiiYN06,
  author       = {Toshimasa Ishii and
                  Shigeyuki Yamamoto and
                  Hiroshi Nagamochi},
  title        = {Augmenting forests to meet odd diameter requirements},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {2},
  pages        = {154--164},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.006},
  doi          = {10.1016/J.DISOPT.2005.10.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/IshiiYN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Kis06,
  author       = {Tam{\'{a}}s Kis},
  title        = {Polyhedral results on single node variable upper-bound flow models
                  with allowed configurations},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {341--353},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.02.001},
  doi          = {10.1016/J.DISOPT.2006.02.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Kis06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/KnustT06,
  author       = {Sigrid Knust and
                  Michael von Thaden},
  title        = {Balanced home-away assignments},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {354--365},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.07.002},
  doi          = {10.1016/J.DISOPT.2006.07.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/KnustT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/KononovL06,
  author       = {Alexander V. Kononov and
                  Bertrand M. T. Lin},
  title        = {On relocation problems with multiple identical working crews},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {366--381},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.06.003},
  doi          = {10.1016/J.DISOPT.2006.06.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/KononovL06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/KrishnamurtiGGS06,
  author       = {Ramesh Krishnamurti and
                  Daya Ram Gaur and
                  Subir Kumar Ghosh and
                  Horst Sachs},
  title        = {Berge's theorem for the maximum charge problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {2},
  pages        = {174--178},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.08.008},
  doi          = {10.1016/J.DISOPT.2005.08.008},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/KrishnamurtiGGS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/LauNN06,
  author       = {Hoong Chuin Lau and
                  Trung Hieu Ngo and
                  Bao Nguyen Nguyen},
  title        = {Finding a length-constrained maximum-sum or maximum-density subtree
                  and its application to logistics},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {385--391},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.06.002},
  doi          = {10.1016/J.DISOPT.2006.06.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/LauNN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/MakB06,
  author       = {Vicky Mak and
                  Natashia Boland},
  title        = {Facets of the polytope of the asymmetric travelling salesman problem
                  with replenishment arcs},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {33--49},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.003},
  doi          = {10.1016/J.DISOPT.2005.10.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/MakB06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/PostW06,
  author       = {Gerhard F. Post and
                  Gerhard J. Woeginger},
  title        = {Sports tournaments, home-away assignments, and the break minimization
                  problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {2},
  pages        = {165--173},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.08.009},
  doi          = {10.1016/J.DISOPT.2005.08.009},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/PostW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/RighiniS06,
  author       = {Giovanni Righini and
                  Matteo Salani},
  title        = {Symmetry helps: Bounded bi-directional dynamic programming for the
                  elementary shortest path problem with resource constraints},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {255--273},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.007},
  doi          = {10.1016/J.DISOPT.2006.05.007},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/RighiniS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/SalemA06,
  author       = {Khaled Salem and
                  Hern{\'{a}}n G. Abeledo},
  title        = {Hypergraphs and the Clar problem in hexagonal systems},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {4},
  pages        = {392--397},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.07.001},
  doi          = {10.1016/J.DISOPT.2006.07.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/SalemA06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/SheraliST06,
  author       = {Hanif D. Sherali and
                  Subhash C. Sarin and
                  Pei{-}Fang Tsai},
  title        = {A class of lifted path and flow-based formulations for the asymmetric
                  traveling salesman problem with and without precedence constraints},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {20--32},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.004},
  doi          = {10.1016/J.DISOPT.2005.10.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/SheraliST06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/TurkensteenGGS06,
  author       = {Marcel Turkensteen and
                  Diptesh Ghosh and
                  Boris Goldengorin and
                  Gerard Sierksma},
  title        = {Iterative patching and the asymmetric traveling salesman problem},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {63--77},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2005.10.005},
  doi          = {10.1016/J.DISOPT.2005.10.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/TurkensteenGGS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.