Models for a Steiner multi-ring network design problem with revenues
From MaRDI portal
Publication:301388
DOI10.1007/s11750-015-0388-6zbMath1350.90025OpenAlexW898150899MaRDI QIDQ301388
Ana Bautzer, Ana Paias, Jose Manuel Pires, Luís Gouveia
Publication date: 30 June 2016
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-015-0388-6
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- Heuristic algorithms for the multi-depot ring-star problem
- Designing tributary networks with multiple ring families.
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- On the asymmetric representatives formulation for the vertex coloring problem
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem
- Improved Formulations for the Ring Spur Assignment Problem
- The Capacitated m-Ring-Star Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- A branch‐and‐cut algorithm for the ring spur assignment problem
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- Models for a Steiner ring network design problem with revenues
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
This page was built for publication: Models for a Steiner multi-ring network design problem with revenues
