Pages that link to "Item:Q1806772"
From MaRDI portal
The following pages link to Solution of the cumulative assignment problem with a well-structured tabu search method (Q1806772):
Displaying 7 items.
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem (Q2459404) (← links)
- Comparing metaheuristic algorithms for SONET network design problems (Q2573001) (← links)
- Hybrid Metaheuristics: An Introduction (Q2950517) (← links)