Pages that link to "Item:Q535395"
From MaRDI portal
The following pages link to Adaptive memory in multistart heuristics for multicommodity network design (Q535395):
Displaying 3 items.
- A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)