Lagrangian relaxation guided problem space search heuristics for generalized assignment problems

DOI10.1016/j.ejor.2006.09.060zbMath1121.90085OpenAlexW2057364598MaRDI QIDQ884028

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

heuristicsLagrangian relaxationgeneralized assignment problemassignmentproblem space search

Mathematics Subject Classification ID

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

Related Items (12)

Decomposition based hybrid metaheuristics ⋮ 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 ⋮ 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 ⋮ Solving the wire-harness design problem at a European car manufacturer ⋮ A Lagrangian bound for many-to-many assignment problems ⋮ Studying properties of Lagrangian bounds for many-to-many assignment problems ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ Resource-constrained management of heterogeneous assets with stochastic deterioration ⋮ A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem

Uses Software

• Tabu search

Cites Work

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

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