Login / Signup
An improved algorithm for the minmax regret median problem on a tree.
Igor Averbakh
Oded Berman
Published in:
Networks (2003)
Keyphrases
</>
minmax regret
interval data
optimization criterion
single machine scheduling problem
combinatorial optimization problems
clustering method
traveling salesman problem
hybrid algorithm
resource allocation problems