Many-to-many assignment problems: Lagrangian bounds and heuristic
MetadataShow full item record
Modified Lagrangian bounds and a greedy heuristic are proposed for many-to-many assignment problems taking into account capacity limits for tasks and agents. A feasible solution recovered by the heuristic is used to speed up the subgradient technique to solve the modified Lagrangian dual. A numerical study is presented to compare the quality of the bounds and to demonstrate the efficiency of the overall approach. © 2012, IGI Global.
How to cite this document
Litvinchev, Igor; Rangel, Socorro. Many-to-many assignment problems: Lagrangian bounds and heuristic. Innovation in Power, Control, and Optimization: Emerging Energy Technologies, p. 220-247. Available at: <http://hdl.handle.net/11449/220161>.