Pages that link to "Item:Q4744083"
From MaRDI portal
The following pages link to Halin graphs and the travelling salesman problem (Q4744083):
Displayed 17 items.
- A survey of very large-scale neighborhood search techniques (Q697563) (← 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)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Decomposition of 3-connected graphs (Q2367440) (← links)
- Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← 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)
- 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)