Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem

DOI10.1504/IJMOR.2012.048928zbMath1390.90580OpenAlexW2051821026MaRDI QIDQ1753757

Imen Ome Ezzine, Sonda Elloumi

Publication date: 29 May 2018

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2012.048928

zbMATH Keywords

heuristicsinteger programmingclustering algorithms\(k\)-TRPbalanced \(k\)-meanspolynomial mathematical formulationtravelling repairman problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

The multi-vehicle cumulative covering tour problem ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands

This page was built for publication: Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem