The following pages link to (Q4461906):
Displaying 15 items.
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Deep clustering of the traveling salesman problem to parallelize its solution (Q6561208) (← links)
- Parameter optimisation of the polynomial randomised algorithm for the asymmetric travelling salesman problem (Q6641476) (← links)
- MILP models of a patient transportation problem (Q6661215) (← links)
