VLSN search algorithms for partitioning problems using matching neighbourhoods
From MaRDI portal
Publication:3515505
DOI10.1057/palgrave.jors.2602356zbMath1145.90426OpenAlexW2037425183MaRDI QIDQ3515505
Temel Öncan, Abraham P. Punnen, K. P. K. Nair, Santosh N. Kabadi
Publication date: 29 July 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602356
integer programminglocal searchcombinatorial analysispartitioning problemsgeneralized assignmentVLSN search
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
This page was built for publication: VLSN search algorithms for partitioning problems using matching neighbourhoods
