Optimal capacitated ring trees

DOI10.1007/s13675-015-0035-xzbMath1342.90111OpenAlexW2031312297MaRDI QIDQ286687

Stefan Voß, Alessandro Hill

Publication date: 25 May 2016

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://repository.uantwerpen.be/docman/irua/d9597f/145286.pdf

zbMATH Keywords

integer programmingvehicle routingSteiner treecapacitated ring tree problemring treesurvivable network design

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

A branch-and-price algorithm for the ring-tree facility location problem, Exact algorithms for bi-objective ring tree problems with reliability measures, A branch-and-cut algorithm for two-level survivable network design problems, Compact formulations for multi-depot routing problems: theoretical and computational comparisons, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, Leader-follower coherence in noisy ring-trees networks, Generalized local branching heuristics and the capacitated ring tree problem, Capacitated ring arborescence problems with profits, Editorial

Uses Software

• SNDlib
• SteinLib
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compact formulations of the Steiner traveling salesman problem and related problems
• A heuristic procedure for the capacitated \(m\)-ring-star problem
• Models for a traveling purchaser problem with additional side-constraints
• The vehicle routing problem. Latest advances and new challenges.
• Exact algorithms for routing problems under vehicle capacity constraints
• Chaos in a seasonally and periodically forced phytoplankton-zooplankton system
• Travelling purchaser problem
• Design of survivable networks
• The Steiner tree polytope and related polyhedra
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• Towards optimizing the deployment of optical access networks
• Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem
• A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem
• The Capacitated m-Ring-Star Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Solving the Two-Connected Network with Bounded Meshes Problem
• Solving Steiner tree problems in graphs to optimality
• Design of Survivable Networks: A survey
• The traveling-salesman problem and minimum spanning trees: Part II
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
• Steiner tree problems