A Linear Programming Based Approach to the Steiner Tree Problem with a Fixed Number of Terminals.
Matías SiebertShabbir AhmedGeorge L. NemhauserPublished in: CoRR (2018)
Keyphrases
- fixed number
- linear programming
- linear program
- finite number
- quadratic programming
- partial ordering
- dynamic programming
- optimal solution
- np hard
- feasible solution
- prize collecting
- objective function
- primal dual
- column generation
- multicast routing
- genetic algorithm
- evolutionary algorithm
- mobile devices
- network flow
- lagrangian relaxation
- computational complexity