Pages that link to "Item:Q1761975"

The following pages link to Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975):

Displaying 12 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)
• Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
• Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
• Extending single tolerances to set tolerances (Q1671336) (← links)
• The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
• Global tolerances in the problems of combinatorial optimization with an additive objective function (Q1930843) (← 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)
• Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)