The following pages link to Temel Öncan (Q319039):
Displaying 13 items.
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- The minimum cost perfect matching problem with conflict pair constraints (Q340285) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem (Q3394069) (← links)
- VLSN search algorithms for partitioning problems using matching neighbourhoods (Q3515505) (← links)
- A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem (Q4596212) (← links)
- A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem (Q5313401) (← links)
- Design of unidirectional cyclic layouts (Q5699940) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Solving a minisum single facility location problem in three regions with different norms (Q6157224) (← links)
