Pages that link to "Item:Q544814"
From MaRDI portal
The following pages link to Local search heuristics for the multidimensional assignment problem (Q544814):
Displaying 17 items.
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Asymptotic properties of random multidimensional assignment problems (Q819336) (← links)
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- Very large-scale neighborhood search for the multidimensional assignment problem (Q1797545) (← links)
- Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem (Q1936794) (← links)
- New heuristics for the multidimensional vote assignment problem (Q1969303) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
- Multidimensional assignment problem for multipartite entity resolution (Q2079699) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459) (← links)
- Ant algorithm for AP-N aimed at optimization of complex systems (Q2902358) (← links)
- Application of Monkey Search Meta-heuristic to Solving Instances of the Multidimensional Assignment Problem (Q3589759) (← links)
- Local search heuristics for multi-index assignment problems with decomposable costs (Q4661195) (← links)
- Branch and bound algorithms for the multidimensional assignment problem (Q5312759) (← links)
