Pages that link to "Item:Q5378843"

The following pages link to On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem (Q5378843):

Displaying 24 items.

• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
• George Dantzig's contributions to integer programming (Q951090) (← links)
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
• A penalized method for multivariate concave least squares with application to productivity analysis (Q1752904) (← links)
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed'' traveling salesman problem. (Q1778797) (← links)
• Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
• Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
• Nash equilibrium solutions in multi-agent project scheduling with milestones (Q2031069) (← links)
• Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
• The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← links)
• Optimizing a linear function over an integer efficient set (Q2503083) (← links)
• Splitting a giant tour using integer linear programming (Q2631278) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• Solving TSP through the integration of OR and CP techniques (Q2741259) (← links)
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study (Q2884495) (← links)
• A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
• (Q4494938) (← links)
• (Q4735051) (← links)
• Advances in Combinatorial Optimization (Q5744058) (← links)
• Solving the probabilistic profitable tour problem on a line (Q6081600) (← links)