A Lagrangian bound for many-to-many assignment problems

DOI10.1007/s10878-008-9196-3zbMath1188.90143OpenAlexW2054003703MaRDI QIDQ975754

Jania Saucedo, Socorro Rangel, Igor S. 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)

Related Items (5)

Lagrangian heuristic for a class of the generalized assignment problems ⋮ Integer programming formulations for approximate packing circles in a rectangular container ⋮ Improved Lagrangian bounds and heuristics for the generalized assignment problem ⋮ A hierarchical solution approach for a multicommodity distribution problem under a special cost structure ⋮ A Lagrangian bound for many-to-many assignment problems

Uses Software

• AMPL
• CPLEX

Cites Work

• 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
• A Lagrangian bound for many-to-many assignment problems
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Relaxation heuristics for a generalized assignment problem
• Localization of the optimal solution and a posteriori bounds for aggregation
• The volume algorithm revisited: relation with bundle methods
• Aggregation in large-scale optimization
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• The volume algorithm: Producing primal solutions with a subgradient method
• Lagrangean/surrogate relaxation for generalized assignment problems
• Lagrangean relaxation. (With comments and rejoinder).
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• A Survey of Lagrangean Techniques for Discrete Optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The omnipresence of Lagrange
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Lagrangian bound for many-to-many assignment problems