A Lagrangian bound for many-to-many assignment problems
From MaRDI portal
Publication:975754
DOI10.1007/S10878-008-9196-3zbMATH Open1188.90143OpenAlexW2054003703MaRDI QIDQ975754FDOQ975754
Authors: Socorro Rangel, Jania Saucedo, I. Litvinchev 
Publication date: 11 June 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9196-3
Recommendations
- Studying properties of Lagrangian bounds for many-to-many assignment problems
- Lagrangian heuristic for a class of the generalized assignment problems
- Comparison of Lagrangian bounds for one class of generalized assignment problems
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- An improved bounding procedure for the constrained assignment problem
Cites Work
- Title not available (Why is that?)
- Assignment problems: a golden anniversary survey
- Title not available (Why is that?)
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The omnipresence of Lagrange
- The volume algorithm: Producing primal solutions with a subgradient method
- Lagrangean relaxation. (With comments and rejoinder).
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- 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
- The volume algorithm revisited: relation with bundle methods
- A Survey of Lagrangean Techniques for Discrete Optimization
- Lagrangean/surrogate relaxation for generalized assignment problems
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Lagrangean Decomposition In Integer Linear Programming: A New Scheme
- Relaxation heuristics for a generalized assignment problem
- A Lagrangian bound for many-to-many assignment problems
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Localization of the optimal solution and a posteriori bounds for aggregation
- Aggregation in large-scale optimization
Cited In (8)
- Integer programming formulations for approximate packing circles in a rectangular container
- Title not available (Why is that?)
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
- Lagrangian heuristic for a class of the generalized assignment problems
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- A Lagrangian bound for many-to-many assignment problems
- Comparison of Lagrangian bounds for one class of generalized assignment problems
Uses Software
This page was built for publication: A Lagrangian bound 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 Q975754)
