Pages that link to "Item:Q2482753"
From MaRDI portal
The following pages link to Tolerance-based branch and bound algorithms for the ATSP (Q2482753):
Displaying 21 items.
- New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412) (← links)
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
- Stability analysis in discrete optimization involving generalized addition operations (Q896189) (← links)
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Global tolerances in the problems of combinatorial optimization with an additive objective function (Q1930843) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
- (Q4414638) (← links)
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710803) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)
- Assessing the effect of multiple cost changes using reverse set tolerances (Q6558690) (← links)