A greedy heuristic and a lower bound on a nonlinear stochastic TSP with partially satisfied node demand coverage constraint.
Murat CalSenol AltanPublished in: Int. J. Math. Oper. Res. (2023)
Keyphrases
- greedy heuristic
- lower bound
- np hard
- optimal solution
- upper bound
- capacity constraints
- branch and bound algorithm
- lagrangian relaxation
- minimum weight
- branch and bound
- minimum cost
- knapsack problem
- traveling salesman problem
- set cover
- objective function
- worst case analysis
- search space
- linear programming relaxation
- sequential quadratic programming
- linear constraints
- travelling salesman
- integer programming
- greedy algorithm
- worst case
- lower and upper bounds
- ant colony optimization
- constraint satisfaction problems
- machine learning
- scheduling problem
- randomized algorithm
- heuristic solution
- linear programming
- inventory systems
- stochastic programming
- linear program
- inventory control
- online algorithms
- directed graph
- spanning tree
- approximation algorithms
- sufficiently accurate
- wireless sensor networks
- lead time