Pages that link to "Item:Q955595"

The following pages link to A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595):

Displaying 50 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• Modeling lotsizing and scheduling problems with sequence dependent setups (Q297372) (← links)
• The traveling salesman problem with time-dependent service times (Q320683) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Solving the family traveling salesman problem (Q723922) (← links)
• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
• Classification of travelling salesman problem formulations (Q911990) (← links)
• An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• An iterated local search for the traveling salesman problem with release dates and completion time minimization (Q1651639) (← links)
• Integer programming models and linearizations for the traveling car renter problem (Q1653275) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (Q1681433) (← links)
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← links)
• Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem (Q1728250) (← links)
• Local search inequalities (Q1751111) (← links)
• The set orienteering problem (Q1754239) (← links)
• Selective and periodic inventory routing problem for waste vegetable oil collection (Q1758051) (← links)
• The traveling salesman problem with draft limits (Q1761142) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
• Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
• The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
• The prisoner transportation problem (Q2178139) (← links)
• A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
• Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities (Q2240012) (← links)
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• Assignment problem with conflicts (Q2273673) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
• Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
• Exact approaches for the cutting path determination problem (Q2329729) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)