Generating lower bounds for the prize collecting Steiner problem in graphs.
Abilio LucenaMauricio G. C. ResendePublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- prize collecting
- lower bound
- upper bound
- branch and bound algorithm
- graph theory
- branch and bound
- np hard
- objective function
- vc dimension
- travel time
- lagrangian relaxation
- worst case
- neural network
- graph matching
- lower and upper bounds
- minimum spanning tree
- computational complexity
- linear program
- single machine scheduling problem