An integer programming formulation of the Steiner problem in graphs

DOI10.1007/BF01415533zbMath0784.90093OpenAlexW2326413840MaRDI QIDQ4031973

Ján Plesník, Mamadi Diané

Publication date: 3 May 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415533

zbMATH Keywords

Steiner probleminteger linear programmingSteiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• Unnamed Item
• A dual ascent approach for steiner tree problems on a directed graph
• Steiner problem in networks: A survey
• An integer linear programming approach to the steiner problem in graphs
• Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
• An algorithm for the steiner problem in graphs
• Steiner tree problems

This page was built for publication: An integer programming formulation of the Steiner problem in graphs