Models for a Steiner ring network design problem with revenues

DOI10.1016/S0377-2217(00)00144-2zbMath1006.90014OpenAlexW1995408797MaRDI QIDQ5943555

Jose Manuel Pires, Luís Gouveia

Publication date: 4 July 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00144-2

zbMATH Keywords

disaggregated Miller-Tucker-Zemlin constraintsmixed integer programming formulations and relaxationsmulticommodity flow modelsring network design

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items (4)

Models for a Steiner multi-ring network design problem with revenues ⋮ Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem ⋮ The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints ⋮ Capacitated ring arborescence problems with profits

Cites Work

• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• Topological design of ring networks
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
• Integer Programming Formulation of Traveling Salesman Problems
• The prize collecting traveling salesman problem
• The Covering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• Optimal tour planning with specified nodes
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints

This page was built for publication: Models for a Steiner ring network design problem with revenues