Abstract
We describe a new dual descent method for a pure 0— location problem known as the capacitated concentrator location problem. The multiplier adjustment technique presented is aimed to find an upper bound in a Lagrangean relaxation context permitting both to decrease and to increase multipliers in the course of the search in contrast with methods where that ones are monotonically updated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have