Pages that link to "Item:Q1146121"

The following pages link to The travelling salesman problem as a constrained shortest path problem: Theory and computational experience (Q1146121):

Displaying 34 items.

• The shortest path problem with forbidden paths (Q146692) (← links)
• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
• A column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) (← links)
• A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
• Microcomputer-based algorithms for large scale shortest path problems (Q1072451) (← links)
• Convergent duality for the traveling salesman problem (Q1178716) (← links)
• MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
• A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
• A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem (Q2583711) (← links)
• Freight railway operator timetabling and engine scheduling (Q2629669) (← links)
• New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
• A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
• A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows (Q2883579) (← links)
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem (Q3511375) (← links)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683) (← links)
• Robust Team Orienteering Problem with Decreasing Profits (Q5060796) (← links)
• A rollout algorithm for the resource constrained elementary shortest path problem (Q5198052) (← links)
• The hazardous orienteering problem (Q6179713) (← links)