scientific article; zbMATH DE number 1488098
From MaRDI portal
Publication:4495204
zbMath0985.90079MaRDI QIDQ4495204
Toshihide Ibaraki, Takashi Yamaguchi, Mutsunori Yagiura
Publication date: 10 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
local searchtraveling salesman problemassignment problemvariable depth searchgraph partitioning problem
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (10)
Multi-neighborhood local search optimization for machine reassignment problem ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ A survey of very large-scale neighborhood search techniques ⋮ A tabu search heuristic for the generalized assignment problem ⋮ Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships ⋮ 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 ⋮ An effective local search for the maximum clique problem ⋮ A path relinking approach with ejection chains for the generalized assignment problem
This page was built for publication:
