Optimal capacitated ring trees
DOI10.1007/S13675-015-0035-XzbMATH Open1342.90111OpenAlexW2031312297MaRDI QIDQ286687FDOQ286687
Authors: Alessandro Hill, Stefan Voß 
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
Recommendations
- Multi-exchange neighborhoods for the capacitated ring tree problem
- The ring tree facility location problem
- Exact algorithms for bi-objective ring tree problems with reliability measures
- The Capacitated m-Ring-Star Problem
- An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem
integer programmingvehicle routingSteiner treecapacitated ring tree problemring treesurvivable network design
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- Solving Steiner tree problems in graphs to optimality
- Compact formulations of the Steiner traveling salesman problem and related problems
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Design of Survivable Networks: A survey
- The vehicle routing problem. Latest advances and new challenges.
- The traveling-salesman problem and minimum spanning trees: Part II
- 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
- 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
- Title not available (Why is that?)
- Solving the Two-Connected Network with Bounded Meshes Problem
- Title not available (Why is that?)
- Steiner tree problems in telecommunications
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Steiner tree problems
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- Models for a traveling purchaser problem with additional side-constraints
- Exact algorithms for routing problems under vehicle capacity constraints
Cited In (16)
- Leader-follower coherence in noisy ring-trees networks
- Capacitated ring arborescence problems with profits
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Models for a Steiner multi-ring network design problem with revenues
- Editorial
- Exact algorithms for bi-objective ring tree problems with reliability measures
- The ring tree facility location problem
- New path elimination constraints for multi-depot routing problems
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- Efficient algorithms for wavelength assignment on trees of rings
- A branch-and-price algorithm for the ring-tree facility location problem
- Multi-exchange neighborhoods for the capacitated ring tree problem
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
- A branch-and-cut algorithm for two-level survivable network design problems
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Generalized local branching heuristics and the capacitated ring tree problem
Uses Software
This page was built for publication: Optimal capacitated ring trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286687)
