A practical algorithm for computing a subadditive dual function for set partitioning
From MaRDI portal
Publication:1771223
DOI10.1023/B:COAP.0000044186.99585.51zbMath1062.90038MaRDI QIDQ1771223
Publication date: 7 April 2005
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:coap.0000044186.99585.51
Related Items
Solving the \(p\)-median problem with a semi-Lagrangian relaxation, On a class of subadditive duals for the uncapacitated facility location problem, A dual ascent procedure for the set partitioning problem, Non-linear anonymous pricing combinatorial auctions, Subadditive approaches in integer programming