A minmax regret median problem on a tree under uncertain locations of the demand points.
Eduardo CondePublished in: Oper. Res. Lett. (2013)
Keyphrases
- minmax regret
- interval data
- optimization criterion
- weighted distance
- demand points
- single machine scheduling problem
- resource allocation problems
- shortest path problem
- combinatorial optimization problems
- facility location problem
- temporal data
- data clustering
- transportation problem
- efficient solutions
- decision making
- network design problem
- branch and bound algorithm
- search space