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

DOI10.1134/S1064230709030046zbMath1308.49023MaRDI QIDQ2017507

Yanyan Li

Publication date: 23 March 2015

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

Mathematics Subject Classification ID

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

Related Items (1)

Packing circular-like objects in a rectangular container

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• About Lagrangian methods in integer optimization
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Assignment problems: a golden anniversary survey
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Relaxation heuristics for a generalized assignment problem
• Lagrangean/surrogate relaxation for generalized assignment problems
• Lagrangean relaxation. (With comments and rejoinder).
• Comparison of Lagrangian bounds for one class of generalized assignment problems
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• A Survey of Lagrangean Techniques for Discrete Optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees

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