Pages that link to "Item:Q1089267"

The following pages link to Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267):

Displayed 13 items.

• Method of scaling in approximate solution of the traveling salesman problem (Q2392635) ‎ (← links)
• Optimality conditions to the acyclic travelling salesman problem. (Q2467841) ‎ (← links)
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846) ‎ (← links)
• Point-to-point and multi-goal path planning for industrial robots (Q2745507) ‎ (← links)
• Playing Billiards in Version Space (Q3123289) ‎ (← links)
• Strategies for LP-based solving a general class of scheduling problems (Q3468869) ‎ (← links)
• Exact and inexact solution procedures for the order picking in an automated carousal conveyor (Q3533209) ‎ (← links)
• Separating maximally violated comb inequalities in planar graphs (Q4645943) ‎ (← links)
• Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) ‎ (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) ‎ (← links)
• Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem (Q5114991) ‎ (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) ‎ (← links)
• Logic-based Benders decomposition for wildfire suppression (Q6068720) ‎ (← links)