Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem

DOI10.1007/978-3-319-15585-2_10zbMath1358.68223OpenAlexW1556818471MaRDI QIDQ2814545

Alessandro Hill

Publication date: 22 June 2016

Published in: Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://repository.uantwerpen.be/docman/irua/33c881/145287.pdf

zbMATH Keywords

local searchnetwork designcapacitated ring tree problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Optimal capacitated ring trees ⋮ A branch-and-price algorithm for the ring-tree facility location problem ⋮ The ring tree facility location problem ⋮ Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ Generalized local branching heuristics and the capacitated ring tree problem ⋮ Capacitated ring arborescence problems with profits

This page was built for publication: Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem