IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p105-11510.1023-a1018990331754.html
   My bibliography  Save this article

Logical reduction tests for the p‐problem

Author

Listed:
  • P. Avella
  • A. Sforza

Abstract

Preprocessing plays a crucial role in solving combinatorial optimization problems. Itcan be realized through reduction tests which allow one to determine in advance the valuesthat a set of variables will take in the optimal solution, thus reducing the size of an instance.Reduction tests can be summarily classified in two main families: those based on reducedcosts and those based on logical implications. The first rely on reduced costs of the LinearProgramming problem associated to continuous relaxation. The second are based on thespecial features of the problem and on combinatorial techniques. In this paper, some effectivereduction tests for the p‐median problem are proposed, showing their impact on the size ofthe instances and on model formulation. Finally, some work perspectives to embed reductiontests into solution algorithms for the p‐median problem are pointed out. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • P. Avella & A. Sforza, 1999. "Logical reduction tests for the p‐problem," Annals of Operations Research, Springer, vol. 86(0), pages 105-115, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:105-115:10.1023/a:1018990331754
    DOI: 10.1023/A:1018990331754
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018990331754
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018990331754?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:annopr:v:86:y:1999:i:0:p:105-115:10.1023/a:1018990331754. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.