A practical algorithm for computing a subadditive dual function for set partitioning

DOI10.1023/B:COAP.0000044186.99585.51zbMath1062.90038OpenAlexW2037706118MaRDI QIDQ1771223

Diego Klabjan

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

zbMATH Keywords

integer programmingduality

Mathematics Subject Classification ID

Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)

Related Items (5)

Subadditive approaches in integer programming ⋮ 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

This page was built for publication: A practical algorithm for computing a subadditive dual function for set partitioning