Pages that link to "Item:Q4210360"

The following pages link to Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey (Q4210360):

Displaying 50 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
• Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356) (← links)
• Sequencing situations with just-in-time arrival, and related games (Q486940) (← links)
• Discrete optimization: an Austrian view (Q537581) (← links)
• Pyramidal tours and multiple objectives (Q604948) (← links)
• On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
• Three value TSP and linkages with the three value linear spanning 2-forests (Q765337) (← links)
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation (Q779022) (← links)
• Optimal wire ordering and spacing in low power semiconductor design (Q847831) (← links)
• A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
• A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
• Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
• An approximation algorithm for a bottleneck traveling salesman problem (Q1026245) (← links)
• A note on the approximation of the asymmetric traveling salesman problem. (Q1417511) (← links)
• An asymmetric analog of van der Veen conditions and the traveling salesman problem. II (Q1600886) (← links)
• An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices (Q1602709) (← links)
• New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
• Scheduling electric vehicles and locating charging stations on a path (Q1617297) (← links)
• The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
• Some properties of the skeleton of the pyramidal tours polytope (Q1689899) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← links)
• Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
• Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
• The maximum traveling salesman problem on van der Veen matrices (Q1765370) (← links)
• Exact algorithms for the order picking problem (Q1782167) (← links)
• Using well-solvable minimum cost exact covering for VLSI clock energy minimization (Q1785247) (← links)
• Exact and heuristic algorithms for routing AGV on path with precedence constraints (Q1793242) (← links)
• The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• The maximum travelling salesman problem on symmetric Demidenko matrices (Q1962061) (← links)
• Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
• High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system (Q2029029) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
• Minimizing the makespan on a single machine subject to modular setups (Q2124915) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• The two-stripe symmetric circulant TSP is in P (Q2164712) (← links)
• Approximating the 2-machine flow shop problem with exact delays taking two values (Q2174271) (← links)
• Estimation of Monge matrices (Q2203631) (← links)
• The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
• An exact method for scheduling a yard crane (Q2256284) (← links)
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269) (← links)
• Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (Q2362173) (← links)
• Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← links)