Studying properties of Lagrangian bounds for many-to-many assignment problems

DOI10.1134/S1064230709030046MaRDI QIDQ2017507zbMATH OpenFDO

Authors Yanyan Li

Publication date 23 March 2015

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1064230709030046

Mathematics Subject Classification ID

Linear optimal control problems (49N05) Applications of optimal control and differential games (49N90) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Comparison of Lagrangian bounds for one class of generalized assignment problems
• A Lagrangian bound for many-to-many assignment problems
• Lagrangian heuristic for a class of the generalized assignment problems
• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• Critical objective function values in linear sum assignment problems

Cites work

• A Survey of Lagrangean Techniques for Discrete Optimization
• About Lagrangian methods in integer optimization
• Assignment problems: a golden anniversary survey
• Comparison of Lagrangian bounds for one class of generalized assignment problems
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1737519 (Why is no real title available?)
• Lagrangean relaxation. (With comments and rejoinder).
• Lagrangean/surrogate relaxation for generalized assignment problems
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Relaxation heuristics for a generalized assignment problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• The Traveling-Salesman Problem and Minimum Spanning Trees

Cited in

(5)

• Critical objective function values in linear sum assignment problems
• Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
• Comparison of Lagrangian bounds for one class of generalized assignment problems
• Packing circular-like objects in a rectangular container
• A Lagrangian bound for many-to-many assignment problems

Describes a project that uses

Uses Software

• AMPL

This page was built for publication: Studying properties of Lagrangian bounds for many-to-many assignment problems

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