Search
Now showing items 1-2 of 2
Efficient tabu search implementations for asymmetric traveling salesman problems
(2009)
Combinatorial optimization problems are widely used to model various
managerial problems including scheduling, location, routing etc. Many of
these problems are known to be NP-hard. Therefore, heuristics and metaheuristics ...
Multi-Period Facility Location Problem With an Uncertain Number of Servers
(2016)
Facility location problems reported in the literature generally assume the problem parameter values (like cost, budget, etc.) to be known with complete certainty, even if they change over time (as in multi-period versions). ...