Lagrangian relaxation guided problem space search heuristics for generalized assignment problems

DOI10.1016/J.EJOR.2006.09.060MaRDI QIDQ884028zbMATH OpenOpenAlexFDO

Authors V. Jeet, Erhan Kutanoglu

Publication date 13 June 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.09.060

zbMATH Keywords

heuristicsassignmentLagrangian relaxationgeneralized assignment problemproblem space search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• A new Lagrangian relaxation approach to the generalized assignment problem
• Relaxation heuristics for a generalized assignment problem
• scientific article; zbMATH DE number 40470
• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• Lagrangean/surrogate relaxation for generalized assignment problems

Cites work

• scientific article; zbMATH DE number 3743004 (Why is no real title available?)
• scientific article; zbMATH DE number 40470 (Why is no real title available?)
• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• scientific article; zbMATH DE number 1488098 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• A class of greedy algorithms for the generalized assignment problem
• A dynamic tabu search for large-scale generalized assignment problems
• A family of inequalities for the generalized assignment polytope
• A genetic algorithm for the generalised assignment problem
• A guide to vehicle routing heuristics
• A path relinking approach with ejection chains for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• A simple dual algorithm for the generalised assignment problem
• A survey of algorithms for the generalized assignment problem
• A tabu search heuristic for the generalized assignment problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• An Effective Lagrangian Heuristic For The Generalized Assignment Problem
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• An ejection chain approach for the generalized assignment problem
• An overview of heuristic solution methods
• Effective algorithm and heuristic for the generalized assignment problem.
• Extensions to the generalised assignment heuristic for vehicle routing
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Lagrangean/surrogate relaxation for generalized assignment problems
• Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
• Modeling Facility Location Problems as Generalized Assignment Problems
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• Problem space local search for number partitioning
• Problem space search algorithms for resource-constrained project scheduling
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Tabu search for the multilevel generalized assignment problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The generalized assignment problem
• The generalized assignment problem: Valid inequalities and facets
• The noising method: A new method for combinatorial optimization

Cited in

(23)

• A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem
• Solving the wire-harness design problem at a European car manufacturer
• Studying properties of Lagrangian bounds for many-to-many assignment problems
• A new Lagrangian relaxation approach to the generalized assignment problem
• Finding improving directions in Lagrangian relaxation by fictitious play: A NASA scheduling application
• The equilibrium generalized assignment problem and genetic algorithm
• An LP-based metaheuristic procedure for the k-sequential generalized assignment problem
• A Lagrangian Relaxation Approach To The Classroom Assignment Problem^*
• An Effective Lagrangian Heuristic For The Generalized Assignment Problem
• Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
• Decomposition based hybrid metaheuristics
• A Survey of the Generalized Assignment Problem and Its Applications
• Lagrangian heuristic for a class of the generalized assignment problems
• Lagrangean/surrogate relaxation for generalized assignment problems
• Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem
• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• A Lagrangian bound for many-to-many assignment problems
• Relaxation heuristics for a generalized assignment problem
• Resource-constrained management of heterogeneous assets with stochastic deterioration
• Lagrangian relaxation of the generic materials and operations planning model
• A meta-heuristic extension of the Lagrangian heuristic framework
• Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
• Adaptive CP-based Lagrangian relaxation for TSP solving

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Lagrangian relaxation guided problem space search heuristics for generalized assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884028)