Models for a Steiner ring network design problem with revenues

DOI10.1016/S0377-2217(00)00144-2MaRDI QIDQ5943555zbMATH OpenOpenAlexFDO

Authors Luis Gouveia, Jose Manuel Pires

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

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

Recommendations

• Models for a Steiner multi-ring network design problem with revenues
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• The ring/-rings network design problem: model and branch-and-cut algorithm
• Approaches to the Steiner Problem in Networks
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Models and algorithms for network design problems
• An initial study of budgeted Steiner networks
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• Steiner problem in networks: A survey
• On network design problems: fixed cost flows and the covering Steiner problem

Cites work

• scientific article; zbMATH DE number 3847427 (Why is no real title available?)
• Integer Programming Formulation of Traveling Salesman Problems
• Network flows. Theory, algorithms, and applications.
• Optimal tour planning with specified nodes
• Solving the Orienteering Problem through Branch-and-Cut
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
• The Covering Tour Problem
• The prize collecting traveling salesman problem
• The selective travelling salesman problem
• Topological design of ring networks

Cited in

(4)

• Capacitated ring arborescence problems with profits
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• Models for a Steiner multi-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 ring network design problem with revenues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943555)