Improved Lagrangian bounds and heuristics for the generalized assignment problem

DOI10.1134/S1064230717050070zbMath1390.90589OpenAlexW2760850844MaRDI QIDQ1745880

Xianqiang Yang

Publication date: 18 April 2018

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230717050070

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Large-scale systems (93A15)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact method with variable fixing for solving the generalized assignment problem
• Assignment problems: a golden anniversary survey
• Minimax in transportation models with integral constraints. I
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• A Lagrangian bound for many-to-many assignment problems
• A genetic algorithm for the generalised assignment problem
• Transportation problems with a minimax criterion
• Tabu search for the multilevel generalized assignment problem
• A minimax under nonlinear transportation constraints.
• A class of greedy algorithms for the generalized assignment problem
• Network models with fixed parameters at the communication nodes. II
• Network models with fixed parameters at the communication nodes. I
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Minimax in transportation models with integral constraints. II
• Hereditarily minimax matrices in models of transportation type
• Assignment Problems
• The omnipresence of Lagrange
• Refinement of Lagrangian bounds in optimization problems

This page was built for publication: Improved Lagrangian bounds and heuristics for the generalized assignment problem