Studying properties of Lagrangian bounds for many-to-many assignment problems
From MaRDI portal
Publication:2017507
DOI10.1134/S1064230709030046zbMATH Open1308.49023MaRDI QIDQ2017507FDOQ2017507
Authors: Yanyan Li 
Publication date: 23 March 2015
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
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
Optimality conditions and duality in mathematical programming (90C46) Applications of optimal control and differential games (49N90) Linear optimal control problems (49N05)
Cites Work
- Title not available (Why is that?)
- Assignment problems: a golden anniversary survey
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Lagrangean relaxation. (With comments and rejoinder).
- About Lagrangian methods in integer optimization
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Title not available (Why is that?)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A Survey of Lagrangean Techniques for Discrete Optimization
- Lagrangean/surrogate relaxation for generalized assignment problems
- Relaxation heuristics for a generalized assignment problem
- Comparison of Lagrangian bounds for one class of generalized assignment problems
Cited In (4)
Uses Software
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)
