On the number of local minima for the multidimensional assignment problem
From MaRDI portal
Publication:867022
DOI10.1007/s10878-006-9009-5zbMath1112.90067OpenAlexW2012550893MaRDI QIDQ867022
Carlos A. S. Oliveira, Pavlo A. Krokhmal, Panos M. Pardalos, Don A. Grundel
Publication date: 14 February 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9009-5
Combinatorial optimizationLocal minimaMultidimensional assignment problemNeighborhood searchRandom costs
Related Items
In and out forests on combinatorial landscapes, Asymptotic behavior of the expected optimal value of the multidimensional assignment problem, Computational Studies of Randomized Multidimensional Assignment Problems, Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem, Random assignment problems, Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Asymptotic results for random multidimensional assignment problems
- A probabilistic heuristic for a computationally difficult set covering problem
- The multivariate normal distribution
- Generating quadratic assignment test problems with known optimal permutations
- Greedy randomized adaptive search procedures
- Simulation-based optimization: Parametric optimization techniques and reinforcement learning
- Solving the multisensor data association problem.
- GRASP with Path Relinking for Three-Index Assignment
- APPLYING SIMULATED ANNEALING TO THE MULTIDIMENSIONAL ASSIGNMENT PROBLEM
- An Algorithm for the Three-Index Assignment Problem
- Letter to the Editor—The Multidimensional Assignment Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- On the landscape ruggedness of the quadratic assignment problem
