Tight compact models and comparative analysis for the prize collecting Steiner tree problem

DOI10.1016/j.dam.2011.09.012zbMath1269.90127OpenAlexW1965320883MaRDI QIDQ1941390

Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali

Publication date: 12 March 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.012

zbMATH Keywords

Steiner treemixed-integer programmingreformulation-linearization techniqueMTZ subtour elimination constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items (5)

Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles ⋮ The coastal seaspace patrol sector design and allocation problem ⋮ Breakout local search for the Steiner tree problem with revenue, budget and hop constraints ⋮ Allocating nodes to hubs for minimizing the hubs processing resources: A case study ⋮ Solving the selective multi-category parallel-servicing problem

This page was built for publication: Tight compact models and comparative analysis for the prize collecting Steiner tree problem