On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.
Claudia D'AmbrosioMarcia FampaJon LeeStefan VigerskePublished in: Optim. Lett. (2020)
Keyphrases
- mixed integer nonlinear programming
- mixed integer
- second order cone program
- mixed integer linear programming
- nonlinear programming
- linear programming
- saddle point
- linear program
- cutting plane
- semi infinite
- quadratic program
- variational inequalities
- optimal solution
- finite dimensional
- linear constraints
- discrete space
- optimality conditions
- euclidean space
- missing data
- single commodity
- low dimensional
- optimization problems
- continuous variables
- convex optimization