The following pages link to (Q4247462):
Displaying 44 items.
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Compact representations of all members of an independence system (Q513340) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Loop based facility planning and material handling (Q707078) (← links)
- On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices (Q817149) (← links)
- The quadratic assignment problem in the context of the printed circuit board assembly process (Q850316) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Detailed layout planning for irregularly-shaped machines with transportation path design (Q856265) (← links)
- Random assignment problems (Q953417) (← links)
- Repulsive assignment problem (Q963661) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- The doubly graded matrix cone and Ferrers matrices (Q1399239) (← links)
- Locating names on vertices of a transaction network (Q1683066) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- Leveraging special-purpose hardware for local search heuristics (Q2125062) (← links)
- A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
- Embedding signed graphs in the line (Q2253962) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- Modelling convex shape priors and matching based on the Gromov-Wasserstein distance (Q2513328) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Subgraph Matching with Semidefinite Programming (Q3438926) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
- Exact matching of random graphs with constant correlation (Q6041769) (← links)
- Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
