The following pages link to Ị. Kuban Altınel (Q336700):
Displaying 4 items.
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- (Q1742189) (redirect page) (← links)
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance (Q1751769) (← links)
