default search action
Search dblp for Publications
export results for "toc:db/journals/anor/anor110.bht:"
@article{DBLP:journals/anor/AverbakhB02, author = {Igor Averbakh and Oded Berman}, title = {Minmax \emph{p}-Traveling Salesmen Location Problems on a Tree}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {55--68}, year = {2002}, url = {https://doi.org/10.1023/A:1020759332183}, doi = {10.1023/A:1020759332183}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/AverbakhB02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/BermanK02, author = {Oded Berman and Dmitry Krass}, title = {Recent Developments in the Theory and Applications of Location Models: {A} Preview}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {15--16}, year = {2002}, url = {https://doi.org/10.1023/A:1020719714437}, doi = {10.1023/A:1020719714437}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/BermanK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/BurkardD02, author = {Rainer E. Burkard and Helidon Dollani}, title = {A Note on the Robust 1-Center Problem on Trees}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {69--82}, year = {2002}, url = {https://doi.org/10.1023/A:1020711416254}, doi = {10.1023/A:1020711416254}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/BurkardD02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/DaskinCS02, author = {Mark S. Daskin and Collette R. Coullard and Zuo{-}Jun Max Shen}, title = {An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {83--106}, year = {2002}, url = {https://doi.org/10.1023/A:1020763400324}, doi = {10.1023/A:1020763400324}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/anor/DaskinCS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/GeorgeRC02, author = {James W. George and Charles S. Revelle and John R. Current}, title = {The Maximum Utilization Subtree Problem}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {133--151}, year = {2002}, url = {https://doi.org/10.1023/A:1020719718071}, doi = {10.1023/A:1020719718071}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/GeorgeRC02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/HamacherLNS02, author = {Horst W. Hamacher and Martine Labb{\'{e}} and Stefan Nickel and Anders J. V. Skriver}, title = {Multicriteria Semi-Obnoxious Network Location Problems {(MSNLP)} with Sum and Center Objectives}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {33--53}, year = {2002}, url = {https://doi.org/10.1023/A:1020707315345}, doi = {10.1023/A:1020707315345}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/HamacherLNS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Hodgson02, author = {M. John Hodgson}, title = {Data Surrogation Error in \emph{p}-Median Models}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {153--165}, year = {2002}, url = {https://doi.org/10.1023/A:1020771702141}, doi = {10.1023/A:1020771702141}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Hodgson02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Klincewicz02, author = {John G. Klincewicz}, title = {Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {107--122}, year = {2002}, url = {https://doi.org/10.1023/A:1020715517162}, doi = {10.1023/A:1020715517162}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Klincewicz02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/NuggehalliLW02, author = {Ranganath Nuggehalli and Timothy J. Lowe and James E. Ward}, title = {An Improved Lower Bound for the Multimedian Location Problem}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {17--31}, year = {2002}, url = {https://doi.org/10.1023/A:1020755231275}, doi = {10.1023/A:1020755231275}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/NuggehalliLW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/OgryczakZ02, author = {Wlodzimierz Ogryczak and Mariusz Zawadzki}, title = {Conditional Median: {A} Parametric Solution Concept for Location Problems}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {167--181}, year = {2002}, url = {https://doi.org/10.1023/A:1020723818980}, doi = {10.1023/A:1020723818980}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/OgryczakZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/VerterL02, author = {Vedat Verter and Sophie D. Lapierre}, title = {Location of Preventive Health Care Facilities}, journal = {Ann. Oper. Res.}, volume = {110}, number = {1-4}, pages = {123--132}, year = {2002}, url = {https://doi.org/10.1023/A:1020767501233}, doi = {10.1023/A:1020767501233}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/VerterL02.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.