Search dblp for Publications

export results for "toc:db/journals/anor/anor33.bht:"

 download as .bib file

@article{DBLP:journals/anor/BalakrishnanMSW91,
  author       = {Anantaram Balakrishnan and
                  Thomas L. Magnanti and
                  A. Shulman and
                  Richard T. Wong},
  title        = {Models for planning capacity expansion in local access telecommunication
                  networks},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {4},
  pages        = {237--284},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071976},
  doi          = {10.1007/BF02071976},
  timestamp    = {Mon, 10 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/BalakrishnanMSW91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/BernB91,
  author       = {Marshall W. Bern and
                  Daniel Bienstock},
  title        = {Polynomially solvable special cases of the Steiner problem in planar
                  networks},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {6},
  pages        = {403--418},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071979},
  doi          = {10.1007/BF02071979},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/BernB91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Booth91,
  author       = {R. S. Booth},
  title        = {The steiner ratio for five points},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {6},
  pages        = {419--436},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071980},
  doi          = {10.1007/BF02071980},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Booth91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/BoriePT91,
  author       = {Richard B. Borie and
                  R. Gary Parker and
                  Craig A. Tovey},
  title        = {Algorithms for recognition of regular properties and decomposition
                  of recursive graph families},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {3},
  pages        = {125--149},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02115752},
  doi          = {10.1007/BF02115752},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/BoriePT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/BorosH91,
  author       = {Endre Boros and
                  Peter L. Hammer},
  title        = {The max-cut problem and quadratic 0-1 optimization; polyhedral aspects,
                  relaxations and bounds},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {3},
  pages        = {151--180},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02115753},
  doi          = {10.1007/BF02115753},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/BorosH91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/BousbaW91,
  author       = {Choaib Bousba and
                  Laurence A. Wolsey},
  title        = {Finding minimum cost directed trees with demands and capacities},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {4},
  pages        = {285--303},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071977},
  doi          = {10.1007/BF02071977},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/BousbaW91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/CameriniGM91,
  author       = {Paolo M. Camerini and
                  Giulia Galbiati and
                  Francesco Maffioli},
  title        = {The image of weighted combinatorial problems},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {3},
  pages        = {181--197},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02115754},
  doi          = {10.1007/BF02115754},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/CameriniGM91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/ChengH91,
  author       = {Chung{-}Kuan Cheng and
                  T. C. Hu},
  title        = {Ancestor tree for arbitrary multi-terminal cut functions},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {3},
  pages        = {199--213},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02115755},
  doi          = {10.1007/BF02115755},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/ChengH91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/ClausenT91,
  author       = {Jens Clausen and
                  Jesper Larsson Tr{\"{a}}ff},
  title        = {Implementation of parallel branch-and-bound algorithms - experiences
                  with the graph partitioning problem},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {5},
  pages        = {329--349},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073939},
  doi          = {10.1007/BF02073939},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/ClausenT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Colbourn91,
  author       = {Charles J. Colbourn},
  title        = {Combinatorial aspects of network reliability},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {1},
  pages        = {1--15},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02061656},
  doi          = {10.1007/BF02061656},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Colbourn91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Colbourn91a,
  author       = {Charles J. Colbourn},
  title        = {Network reliability: Numbers or insight? - {A} discussion paper},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {2},
  pages        = {85--93},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073593},
  doi          = {10.1007/BF02073593},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Colbourn91a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/DolanWS91,
  author       = {John Dolan and
                  Richard S. Weiss and
                  J. MacGregor Smith},
  title        = {Minimal length tree networks on the unit sphere},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {7},
  pages        = {501--535},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02067239},
  doi          = {10.1007/BF02067239},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/DolanWS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Du91,
  author       = {Ding{-}Zhu Du},
  title        = {On steiner ratio conjectures},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {6},
  pages        = {437--449},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071981},
  doi          = {10.1007/BF02071981},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Du91.bib},
  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      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {6},
  pages        = {451--469},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071982},
  doi          = {10.1007/BF02071982},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/DuinV91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Gavish91,
  author       = {Bezalel Gavish},
  title        = {Topological design of telecommunication networks-local access design
                  methods},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {1},
  pages        = {17--71},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02061657},
  doi          = {10.1007/BF02061657},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Gavish91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/GloverLR91,
  author       = {Fred W. Glover and
                  Micheal Lee and
                  Jennifer Ryan},
  title        = {Least-cost network topology design for a new service - An application
                  of tabu search},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {5},
  pages        = {351--362},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073940},
  doi          = {10.1007/BF02073940},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/GloverLR91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/GouveiaP91,
  author       = {Luis Eduardo Neves Gouveia and
                  Jos{\'{e}} Pinto Paix{\~{a}}o},
  title        = {Dynamic programming based heuristics for the topological design of
                  local access networks},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {4},
  pages        = {305--327},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071978},
  doi          = {10.1007/BF02071978},
  timestamp    = {Mon, 21 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/GouveiaP91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Hassin91,
  author       = {Refael Hassin},
  title        = {Multiterminal xcut problems},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {3},
  pages        = {215--225},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02115756},
  doi          = {10.1007/BF02115756},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Hassin91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Hwang91,
  author       = {Frank K. Hwang},
  title        = {A primer of the Euclidean Steiner problem},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {1},
  pages        = {73--84},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02061658},
  doi          = {10.1007/BF02061658},
  timestamp    = {Fri, 01 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Hwang91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Kubat91,
  author       = {Peter Kubat},
  title        = {Alternatives for reliable and quality telecommunication network design},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {2},
  pages        = {95--105},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073594},
  doi          = {10.1007/BF02073594},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Kubat91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Lawler91,
  author       = {Eugene L. Lawler},
  title        = {Computing shortest paths in networks derived from recurrence relations},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {5},
  pages        = {363--377},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073941},
  doi          = {10.1007/BF02073941},
  timestamp    = {Mon, 29 Mar 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Lawler91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/MaculanSC91,
  author       = {Nelson Maculan and
                  Paulo Souza and
                  Alfredo Candia{-}V{\'{e}}jar},
  title        = {An approach for the Steiner problem in directed graphs},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {6},
  pages        = {471--480},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071983},
  doi          = {10.1007/BF02071983},
  timestamp    = {Fri, 19 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/anor/MaculanSC91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/McKeownRT91,
  author       = {Geoff P. McKeown and
                  Victor J. Rayward{-}Smith and
                  Heather Jane Turpin},
  title        = {Branch-and-bound as a higher-order function},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {5},
  pages        = {379--402},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073942},
  doi          = {10.1007/BF02073942},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/McKeownRT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/PiotrowskiS91,
  author       = {Wiktor Piotrowski and
                  Maciej M. Syslo},
  title        = {Some properties of graph centroids},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {3},
  pages        = {227--236},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02115757},
  doi          = {10.1007/BF02115757},
  timestamp    = {Thu, 09 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/anor/PiotrowskiS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Provan91,
  author       = {J. Scott Provan},
  title        = {The role of Steiner hulls in the solution to Steiner tree problems},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {7},
  pages        = {537--548},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02067240},
  doi          = {10.1007/BF02067240},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Provan91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/RichardsS91,
  author       = {Dana S. Richards and
                  Jeffrey S. Salowe},
  title        = {A simple proof of Hwang's theorem for rectilinear Steiner minimal
                  trees},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {7},
  pages        = {549--556},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02067241},
  doi          = {10.1007/BF02067241},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/RichardsS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/RubinsteinT91,
  author       = {J. Hyam Rubinstein and
                  Doreen A. Thomas},
  title        = {A variational approach to the Steiner network problem},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {6},
  pages        = {481--499},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02071984},
  doi          = {10.1007/BF02071984},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/RubinsteinT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Smith91,
  author       = {D. H. Smith},
  title        = {Optimally reliable networks},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {2},
  pages        = {107--112},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073595},
  doi          = {10.1007/BF02073595},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Smith91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/Widmayer91,
  author       = {Peter Widmayer},
  title        = {On graphs preserving rectilinear shortest paths in the presence of
                  obstacles},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {7},
  pages        = {557--575},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02067242},
  doi          = {10.1007/BF02067242},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Widmayer91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/WinterS91,
  author       = {Pawel Winter and
                  J. MacGregor Smith},
  title        = {Steiner minimal trees for three points with one convex polygonal obstacle},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {7},
  pages        = {577--599},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02067243},
  doi          = {10.1007/BF02067243},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/WinterS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/YebraRR91,
  author       = {J. Luis A. Yebra and
                  Victor J. Rayward{-}Smith and
                  A. P. Revitt},
  title        = {The ({\(\Delta\)}, \emph{d, d{\({'}\)}}, {\(\Delta\)} - 1)-problem
                  with applications to computer networks},
  journal      = {Ann. Oper. Res.},
  volume       = {33},
  number       = {2},
  pages        = {113--124},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF02073596},
  doi          = {10.1007/BF02073596},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/YebraRR91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.