A Lagrangian bound for many-to-many assignment problems

DOI10.1007/S10878-008-9196-3MaRDI QIDQ975754zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer programming

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

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

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1737519 (Why is no real title available?)
• scientific article; zbMATH DE number 2084780 (Why is no real title available?)
• A Lagrangian bound for many-to-many assignment problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• About Lagrangian methods in integer optimization
• Aggregation in large-scale optimization
• Assignment problems: a golden anniversary survey
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean relaxation. (With comments and rejoinder).
• Lagrangean/surrogate relaxation for generalized assignment problems
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Localization of the optimal solution and a posteriori bounds for aggregation
• Relaxation heuristics for a generalized assignment problem
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• The omnipresence of Lagrange
• The volume algorithm revisited: relation with bundle methods
• The volume algorithm: Producing primal solutions with a subgradient method

Cited in

(9)

• Integer programming formulations for approximate packing circles in a rectangular container
• Studying properties of Lagrangian bounds for many-to-many assignment problems
• scientific article; zbMATH DE number 4081306 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• CPLEX
• AMPL

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)