The Euclidean Steiner tree problem in R n: A mathematical programming formulation

Nelson Maculan (), Philippe Michelon () and Adilson Xavier ()

Annals of Operations Research, 2000, vol. 96, issue 1, 209-220

Abstract: A nonconvex mixed-integer programming formulation for the Euclidean Steiner Tree Problem (ESTP) in R n is presented. After obtaining separability between integer and continuous variables in the objective function, a Lagrange dual program is proposed. To solve this dual problem (and obtaining a lower bound for ESTP) we use subgradient techniques. In order to evaluate a subgradient at each iteration we have to solve three optimization problems, two in polynomial time, and one is a special convex nondifferentiable programming problem. Copyright Kluwer Academic Publishers 2000

Keywords: Euclidean Steiner tree problem; duality in nonconvex mixed-integer programming (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018903619285 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:96:y:2000:i:1:p:209-220:10.1023/a:1018903619285

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018903619285

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().