The Steiner tree problem with delays: a compact formulation and reduction procedures
type: Item
instance of: scholarly article
title: The Steiner tree problem with delays: a compact formulation and reduction procedures
zbMATH Open document ID: 1323.90074
author: Valeria Leggieri
author: Mohamed Haouari
author: Chefi Triki
published in: Discrete Applied Mathematics
publication date: 2015-09-22T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6484190
zbMATH Keywords: Steiner tree problem
zbMATH Keywords: MTZ subtour elimination constraints
zbMATH Keywords: reduction techniques
describes a project that uses: SteinLib
MaRDI profile type: Publication
full work available at URL: j.dam.2011.07.008
OpenAlex ID: W2146853131
cites work: Q4426341
cites work: Problem reduction methods and a tree generation algorithm for the steiner network problem
cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut
cites work: Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: Multicommodity flow models for spanning trees with hop constraints
cites work: Modeling and solving the rooted distance-constrained minimum spanning tree problem
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: A dual algorithm for the constrained shortest path problem
cites work: Steiner tree problems
cites work: The shortest route problem with constraints
cites work: Solving Steiner tree problems in graphs to optimality
cites work: Q3048571
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Q4117605
cites work: Q4040221
cites work: A survey of combinatorial optimization problems in multicast routing
cites work: A comparison of Steiner tree relaxations
cites work: A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
cites work: Q3874241
cites work: Preprocessing Steiner problems from VLSI layout
DOI: 10.1016/J.DAM.2011.07.008
description: scientific article; zbMATH DE number 6484190