IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/455.html
   My bibliography  Save this paper

On Search Over Rationals

Author

Listed:
  • Eitan Zemel

Abstract

No abstract is available for this item.

Suggested Citation

  • Eitan Zemel, 1980. "On Search Over Rationals," Discussion Papers 455, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    • Handle: RePEc:nwu:cmsems:455
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/455.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Arie Tamir & Eitan Zemel, 1979. "Locating Centers on a Tree with Discontinuous Supply and Demand Regions," Discussion Papers 397, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. N. Megiddo, 1979. "An O(n log2 n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems," Discussion Papers 379, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Eitan Zemel, 1980. "Polynomial Algorithms for Estimating Network Reliability," Discussion Papers 449, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. J. Puerto & A. M. Rodríguez-Chía & A. Tamir, 2009. "Minimax Regret Single-Facility Ordered Median Location Problems on Networks," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 77-87, February.
    2. Arie Tamir & Eitan Zemel, 1979. "Locating Centers on a Tree with Discontinuous Supply and Demand Regions," Discussion Papers 397, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Haris Aziz & Hau Chan & Barton E. Lee & Bo Li & Toby Walsh, 2019. "Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives," Papers 1911.09813, arXiv.org.
    4. Sven de Vries & Marc Posner & Rakesh Vohra, 2003. "Polyhedral Properties of the K -median Problem on a Tree," Discussion Papers 1367, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    5. Sourour Elloumi & Martine Labbé & Yves Pochet, 2004. "A New Formulation and Resolution Method for the p-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 84-94, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:455. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Fran Walker (email available below). General contact details of provider: https://edirc.repec.org/data/cmnwuus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.