Pages that link to "Item:Q4744083"
From MaRDI portal
The following pages link to Halin graphs and the travelling salesman problem (Q4744083):
Displayed 43 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- Extremal Halin graphs with respect to the signless Laplacian spectra (Q313820) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Treelike snarks (Q727053) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- Boxicity of Halin graphs (Q1025946) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- Hamiltonian properties of Toeplitz graphs (Q1126180) (← links)
- Dominating cycles in Halin graphs (Q1174137) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Forbidden pairs and the existence of a spanning Halin subgraph (Q1684949) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- Normal 6-edge-colorings of some bridgeless cubic graphs (Q2306603) (← links)
- Decomposition of 3-connected graphs (Q2367440) (← links)
- Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838) (← links)
- The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
- Plane Triangulations Without a Spanning Halin Subgraph II (Q4588847) (← links)
- Symmetry breaking in planar and maximal outerplanar graphs (Q4621305) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Dirac's Condition for Spanning Halin Subgraphs (Q5238744) (← links)
- One- and two-page crossing numbers for some types of graphs (Q5747710) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
- On dispersable book embeddings (Q5915585) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q6117080) (← links)
- The Rique-number of graphs (Q6117081) (← links)