The following pages link to Eranda Çela (Q266058):
Displaying 23 items.
- Linearizable special cases of the QAP (Q266060) (← links)
- Heuristics for the data arrangement problem on regular trees (Q498454) (← links)
- The Wiener maximum quadratic assignment problem (Q665991) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
- Hamiltonian cycles in circulant digraphs with two stripes (Q1377694) (← links)
- The quadratic assignment problem. Theory and algorithms (Q1377989) (← links)
- Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
- A minimax assignment problem in treelike communication networks (Q1390338) (← links)
- 2-medians in trees with pos/neg weights (Q1582068) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
- (Q1969299) (redirect page) (← links)
- A dual framework for lower bounds of the quadratic assignment problem based on linearization (Q1969301) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics (Q2571224) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid (Q2691570) (← links)
- (Q3145800) (← links)
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid (Q5886040) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
