Logical reduction tests for the p-problem

DOI10.1023/A:1018990331754zbMATH Open0918.90094OpenAlexW175696406MaRDI QIDQ1290132FDOQ1290132

Authors: Pasquale Avella, Antonio Sforza 

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018990331754

Recommendations

• Complexity evaluation of benchmark instances for the \(p\)-median problem
• Advanced preprocessing techniques for linear and quadratic programming
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• An aggressive reduction scheme for the simple plant location problem
• Data aggregation for \(p\)-median problems

zbMATH Keywords

\(p\)-median problemcontinuous relaxationreduction tests

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cited In (5)

• A branch-and-cut algorithm for the median-path problem
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• Complexity evaluation of benchmark instances for the \(p\)-median problem
• Data aggregation for \(p\)-median problems
• An aggressive reduction scheme for the simple plant location problem

This page was built for publication: Logical reduction tests for the p-problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290132)