The following pages link to Vladimir G. Deǐneko (Q207380):
Displaying 50 items.
- (Q266059) (redirect page) (← links)
- Linearizable special cases of the QAP (Q266060) (← links)
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656) (← links)
- Two hardness results for Gamson's game (Q485436) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- The complexity of computing the Muirhead-Dalton distance (Q1013525) (← links)
- Polygons with inscribed circles and prescribed side lengths (Q1021802) (← links)
- (Q1267181) (redirect page) (← links)
- A solvable case of the quadratic assignment problem (Q1267182) (← links)
- The travelling salesman problem on permuted Monge matrices (Q1288469) (← links)
- (Q1332689) (redirect page) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749) (← links)
- (Q1350907) (redirect page) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- Complexity and approximability results for slicing floorplan designs. (Q1399599) (← links)
- Which matrices are immune against the transportation paradox? (Q1408459) (← links)
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. (Q1575073) (← links)
- Hardness of approximation of the discrete time-cost tradeoff problem (Q1604050) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- (Q1754255) (redirect page) (← 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)
- (Q1805007) (redirect page) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
- On the recognition of permuted Supnick and incomplete Monge matrices (Q1924991) (← links)
- The maximum travelling salesman problem on symmetric Demidenko matrices (Q1962061) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
- Well-solvable instances for the partition problem (Q2371107) (← links)
- On the Euclidean TSP with a permuted van der Veen matrix (Q2390323) (← links)
- Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- On the dimension of simple monotonic games (Q2572841) (← links)
- Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775) (← links)
- The Travelling Salesman and the PQ-Tree (Q2757553) (← links)
- Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (Q2839206) (← links)
- (Q3396593) (← links)
- The approximability of MAX CSP with fixed-value constraints (Q3451267) (← links)
- (Q3576659) (← links)
- Four point conditions and exponential neighborhoods for symmetric TSP (Q3581546) (← links)
- One-Sided Monge TSP Is NP-Hard (Q3600165) (← links)
- (Q3832350) (← links)
- (Q3892067) (← links)
