Pages that link to "Item:Q2496057"
From MaRDI portal
The following pages link to Variable neighborhood search for the linear ordering problem (Q2496057):
Displayed 11 items.
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- On VLSI interconnect optimization and linear ordering problem (Q2443401) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Efficient local search algorithms for the linear ordering problem (Q3002554) (← links)