The following pages link to (Q3768703):
Displaying 50 items.
- Linearizable special cases of the QAP (Q266060) (← links)
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
- Monge properties of sequence alignment (Q418004) (← 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)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts (Q710581) (← links)
- Three value TSP and linkages with the three value linear spanning 2-forests (Q765337) (← links)
- Classes of matrices for the traveling salesman problem (Q804474) (← links)
- Pyramidal tours and the traveling salesman problem (Q809904) (← links)
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- Classifying traveling salesman problems (Q917447) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- An algorithm for the detection and construction of Monge sequences (Q1116656) (← links)
- Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263) (← links)
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Optimal arcs for the traveling salesman problem (Q1195644) (← links)
- Pyramidal tours with step-backs and the asymmetric traveling salesman problem (Q1270772) (← links)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- Scheduling of flexible flow lines in an automobile assembly plant (Q1278630) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (Q1309942) (← links)
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- Graphs in which all Hamiltonian cycles have the same length (Q1337675) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- The computational complexity of Steiner tree problems in graded matrices (Q1372300) (← links)
- Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
- Hamiltonian cycles in circulant digraphs with two stripes (Q1377694) (← links)
- Weighted graphs with all Hamiltonian cycles of the same length (Q1408871) (← links)
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups (Q1577472) (← links)
- Linearity in the traveling salesman problem (Q1588746) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- An asymmetric analog of van der Veen conditions and the traveling salesman problem. II (Q1600886) (← links)
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- The constant objective value property for multidimensional assignment problems (Q1751146) (← links)
- Two-machine flow shop scheduling problems with no-wait jobs (Q1779704) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds (Q1804883) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
