Generalized local branching heuristics and the capacitated ring tree problem

DOI10.1016/j.dam.2017.09.010zbMath1441.05048OpenAlexW2235993894WikidataQ115577871 ScholiaQ115577871MaRDI QIDQ1744240

Stefan Voß, Alessandro Hill

Publication date: 20 April 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://repository.uantwerpen.be/docman/irua/e2cabc/145281.pdf

zbMATH Keywords

local searchmathematical programmingnetwork designmatheuristiccapacitated ring tree problemlocal branching

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mathematical programming (90C99)

Related Items (4)

A branch-and-price algorithm for the ring-tree facility location problem ⋮ Hierarchical survivable network design problems ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ Capacitated ring arborescence problems with profits

Uses Software

• FEASPUMP
• VRP

Cites Work

• Unnamed Item
• POPMUSIC as a matheuristic for the berth allocation problem
• Optimal capacitated ring trees
• The ring tree facility location problem
• Improving heuristics for network modularity maximization using an exact algorithm
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
• RENS. The optimal rounding
• A local branching heuristic for the capacitated fixed-charge network design problem
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• The feasibility pump
• A new ILP-based refinement heuristic for vehicle routing problems
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem
• A Hybrid Heuristic for an Inventory Routing Problem
• Matheuristics

This page was built for publication: Generalized local branching heuristics and the capacitated ring tree problem