Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems.
Pedro Henrique P. V. LiguoriAli Ridha MahjoubGuillaume MarquèsRuslan SadykovEduardo UchoaPublished in: Oper. Res. (2023)
Keyphrases
- related problems
- routing problem
- knapsack problem
- dynamic programming
- broadly applicable
- travel distance
- routing protocol
- stable marriage
- lot sizing
- ad hoc networks
- cover inequalities
- packing problem
- upper bound
- single source
- network design problem
- structured databases
- range searching
- routing algorithm
- multi source
- linear programming
- multi period
- wireless sensor networks
- routing decisions
- vehicle routing problem
- minimum total cost
- feasible solution