Lagrangean/surrogate relaxation for generalized assignment problems
From MaRDI portal
Publication:1809834
Recommendations
- A new Lagrangian relaxation approach to the generalized assignment problem
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- A Lagrangean relaxation method for the constrained assignment problem
- Lagrangian heuristic for a class of the generalized assignment problems
- scientific article; zbMATH DE number 708857
- scientific article; zbMATH DE number 4199971
- Relaxation heuristics for a generalized assignment problem
- scientific article; zbMATH DE number 40470
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
Cites work
- A branch and bound algorithm for the generalized assignment problem
- A fast algorithm for the linear multiple-choice knapsack problem
- A generalized subgradient method with relaxation step
- A genetic algorithm for the generalised assignment problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- A surrogate heuristic for set covering problems
- A survey of algorithms for the generalized assignment problem
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- An improved subgradient method for constrained nondifferentiable optimization
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- An O(n) algorithm for the multiple-choice knapsack linear program
- Calculating surrogate constraints
- Conditional subgradient optimization -- theory and applications
- Convergence of some algorithms for convex minimization
- Exact methods for the knapsack problem and its generalizations
- scientific article; zbMATH DE number 3791939 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3542191 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Minimization of unsmooth functionals
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- Relaxation heuristics for a generalized assignment problem
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Constraints
- Surrogate Mathematical Programming
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
Cited in
(28)- A Lagrangean relaxation method for the constrained assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A column generation approach to capacitated p-median problems
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- A branch-and-price approach to p-median location problems
- Maximal covering code multiplexing access telecommunication networks
- Studying properties of Lagrangian bounds for many-to-many assignment problems
- On generalized surrogate duality in mixed-integer nonlinear programming
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Lagrangian relaxation of the generic materials and operations planning model
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- RAMP for the capacitated minimum spanning tree problem
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- A genetic algorithm for the project assignment problem
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- scientific article; zbMATH DE number 4199971 (Why is no real title available?)
- On Lagrangian Relaxation and Subset Selection Problems
- The equilibrium generalized assignment problem and genetic algorithm
- A column generation approach for the unconstrained binary quadratic programming problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- A Survey of the Generalized Assignment Problem and Its Applications
- Lagrangian heuristic for a class of the generalized assignment problems
- A surrogate-based heuristic for production planning problem of orders in small foundries
- Contemporary approaches in matheuristics an updated survey
- 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
- A Lagrangian bound for many-to-many assignment problems
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
This page was built for publication: Lagrangean/surrogate relaxation for generalized assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809834)
