The Euclidean Steiner tree problem in Rn: A mathematical programming formulation

@article{Maculan2000TheES,
  title={The Euclidean Steiner tree problem in Rn: A mathematical programming formulation},
  author={Nelson Maculan and Philippe Michelon and Adilson Elias Xavier},
  journal={Annals OR},
  year={2000},
  volume={96},
  pages={209-220}
}
A nonconvex mixed-integer programming formulation for the Euclidean Steiner Tree Problem (ESTP) in R 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… CONTINUE READING