Lagrangean/surrogate relaxation for generalized assignment problems
From MaRDI portal
Publication:1809834
DOI10.1016/S0377-2217(98)00038-1zbMath0946.90035OpenAlexW2050274364WikidataQ126298567 ScholiaQ126298567MaRDI QIDQ1809834
Luiz Antonio Nogueira Lorena, Marcelo Gonçalves Narciso
Publication date: 25 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00038-1
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (22)
A Lagrangean decomposition for the maximum independent set problem applied to map labeling ⋮ Maximal covering code multiplexing access telecommunication networks ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Lagrangian heuristic for a class of the generalized assignment problems ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ RAMP for the capacitated minimum spanning tree problem ⋮ A column generation approach for the unconstrained binary quadratic programming problem ⋮ A column generation approach to capacitated \(p\)-median problems ⋮ Lagrangean relaxation with clusters for point-feature cartographic label placement problems ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ A genetic algorithm for the project assignment problem ⋮ A branch-and-price approach to \(p\)-median location problems ⋮ A Lagrangian bound for many-to-many assignment problems ⋮ Studying properties of Lagrangian bounds for many-to-many assignment problems ⋮ A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ Lagrangean decompositions for the unconstrained binary quadratic programming problem ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems ⋮ On generalized surrogate duality in mixed-integer nonlinear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for the linear multiple-choice knapsack problem
- Exact methods for the knapsack problem and its generalizations
- A new Lagrangian relaxation approach to the generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- Conditional subgradient optimization -- theory and applications
- Relaxation heuristics for a generalized assignment problem
- An improved subgradient method for constrained nondifferentiable optimization
- Convergence of some algorithms for convex minimization
- A surrogate heuristic for set covering problems
- A genetic algorithm for the generalised assignment problem
- A generalized subgradient method with relaxation step
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- An O(n) algorithm for the multiple-choice knapsack linear program
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- Some relationships between lagrangian and surrogate duality in integer programming
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Calculating surrogate constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A branch and bound algorithm for the generalized assignment problem
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- Validation of subgradient optimization
- Surrogate Constraints
- Minimization of unsmooth functionals
- The traveling-salesman problem and minimum spanning trees: Part II
- Surrogate Mathematical Programming
This page was built for publication: Lagrangean/surrogate relaxation for generalized assignment problems
