Pages that link to "Item:Q2378458"
From MaRDI portal
The following pages link to Multiobjective traveling salesperson problem on Halin graphs (Q2378458):
Displaying 12 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← 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)
- An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
- Pyramidal tours and multiple objectives (Q604948) (← links)
- An interactive algorithm for multi-objective route planning (Q639934) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- An evolutionary approach to generalized biobjective traveling salesperson problem (Q1652174) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- The graphical traveling salesperson problem has no integer programming formulation in the original space (Q2060618) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- Persistency in the traveling salesman problem on Halin graphs (Q2725186) (← links)
