Pages that link to "Item:Q3315280"

The following pages link to A New Formulation for the Travelling Salesman Problem (Q3315280):

Displaying 30 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
• A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
• Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
• Classification of travelling salesman problem formulations (Q911990) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
• Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
• A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• Routing optimization with time windows under uncertainty (Q2414906) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• Routing optimization under uncertainty (Q2806069) (← links)
• Development of new artificial intelligence systems for solving the travelling salesman problem (Q2850354) (← links)
• Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration (Q3627687) (← links)
• New Monitoring Parameter for the Traveling Salesman Problem (Q4492343) (← links)
• A new heuristic for the traveling salesman problem (Q5202515) (← links)
• New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
• Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses (Q6087542) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• Node based compact formulations for the Hamiltonian <i>p</i>‐median problem (Q6180025) (← links)