A variable depth search algorithm with branching search for the generalized assignment problem
From MaRDI portal
Publication:4946717
DOI10.1080/10556789808805722zbMath0947.90070OpenAlexW2032982020MaRDI QIDQ4946717
Takashi Yamaguchi, Toshihide Ibaraki, Mutsunori Yagiura
Publication date: 29 October 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805722
Related Items (19)
An efficient local search with noising strategy for Google machine reassignment problem ⋮ Fast machine reassignment ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Variable neighbourhood structures for cycle location problems ⋮ A variable depth search branching ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ A personal perspective on problem solving by general purpose solvers ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ Convergence of the surrogate Lagrangian relaxation method ⋮ A tabu search heuristic for the generalized assignment problem ⋮ Bees algorithm for generalized assignment problem ⋮ A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem ⋮ An algorithm for the generalized quadratic assignment problem ⋮ Variable Neighborhood Search for Google Machine Reassignment problem ⋮ A path relinking approach with ejection chains for the generalized assignment problem ⋮ An ejection chain approach for the generalized assignment problem ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
This page was built for publication: A variable depth search algorithm with branching search for the generalized assignment problem
