Login / Signup
Optimal Solution of the Maximum All Request Path Grooming Problem.
Jean-Claude Bermond
Michel Cosnard
David Coudert
Stéphane Pérennes
Published in:
AICT/ICIW (2006)
Keyphrases
</>
optimal solution
objective function
shortest path
np hard
search space
metaheuristic
linear program
global optimum
total cost
feasible solution
optimal path
branch and bound
knapsack problem
real time
endpoints
maximum number
iterative procedure
solution quality
exact solution
database systems
learning algorithm