Multi-exchange neighborhoods for the capacitated ring tree problem

DOI10.1007/978-3-319-15585-2_10MaRDI QIDQ2814545zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Optimal capacitated ring trees
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
• The ring tree facility location problem
• Generalized local branching heuristics and the capacitated ring tree problem
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.

Cited in

(7)

• Generalized local branching heuristics and the capacitated ring tree problem
• Capacitated ring arborescence problems with profits
• A branch-and-price algorithm for the ring-tree facility location problem
• Optimal capacitated ring trees
• 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
• The ring tree facility location problem

This page was built for publication: Multi-exchange neighborhoods for the capacitated ring tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814545)