Pages that link to "Item:Q4834229"

The following pages link to Efficient Algorithms for Solving the Shortest Covering Path Problem (Q4834229):

Displaying 8 items.

• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
• Solving the constrained shortest path problem using random search strategy (Q546424) (← links)
• The transit route arc-node service maximization problem (Q621660) (← links)
• Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
• A review of extensive facility location in networks (Q1278421) (← links)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• Dynamic programming approaches to solve the shortest path problem with forbidden paths (Q4924113) (← links)