A bi-level p-facility network design problem in the presence of congestion.
Mehdi ZaferaniehMaryam AbareshiMorteza JafarzadehPublished in: Comput. Ind. Eng. (2023)
Keyphrases
- bi level
- network design problem
- approximation algorithms
- gray scale
- network design
- branch and bound
- mixed integer
- demand points
- transportation networks
- integer programming
- mixed integer programming
- minimal cost
- valid inequalities
- travel time
- np hard
- lagrangian relaxation
- facility location problem
- color images
- traveling salesman problem
- convex hull
- image compression
- search algorithm