On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.
Claudia D'AmbrosioMarcia FampaJon LeeStefan VigerskePublished in: SEA (2015)
Keyphrases
- mixed integer nonlinear programming
- mixed integer
- second order cone program
- mixed integer linear programming
- nonlinear programming
- linear programming
- saddle point
- semi infinite
- search space
- higher dimensional
- feasible solution
- semidefinite programming
- cutting plane
- quadratic program
- vector space
- convex optimization
- dynamic systems
- euclidean space
- branch and bound algorithm
- discrete space
- optimality conditions
- optimization problems
- upper bound
- probabilistic model
- objective function