Heuristic solution to the product targeting problem based on mathematical programming.
Filiz CetinCigdem Alabas-UsluPublished in: Int. J. Prod. Res. (2017)
Keyphrases
- mathematical programming
- heuristic solution
- linear programming
- feasible solution
- optimal solution
- network design
- lower bound
- combinatorial optimization
- branch and bound
- knapsack problem
- network design problem
- mixed integer linear
- linear program
- robust optimization
- exhaustive search
- production planning
- tree search
- mixed integer
- lagrangian relaxation
- vehicle routing problem
- lower and upper bounds
- computational complexity
- integer programming
- minimal cost
- neural network
- np hard