An integer programming formulation of the Steiner problem in graphs

DOI10.1007/BF01415533MaRDI QIDQ4031973zbMATH OpenOpenAlexFDO

Authors Mamadi Diané, Ján Plesník

Publication date 3 May 1993

Published in 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

integer linear programmingSteiner problemSteiner tree

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• A dual ascent approach for steiner tree problems on a directed graph
• An algorithm for the steiner problem in graphs
• An integer linear programming approach to the steiner problem in graphs
• Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
• Steiner problem in networks: A survey
• Steiner tree problems

Cited in

(2)

• Using multiflow formulations to solve the Steiner tree problem in graphs
• A variational approach to the Steiner network problem

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

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