Logical reduction tests for the p‐problem

P. Avella and A. Sforza

Annals of Operations Research, 1999, vol. 86, issue 0, 105-115

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

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018990331754 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:86:y:1999:i:0:p:105-115:10.1023/a:1018990331754

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018990331754

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().