Pages that link to "Item:Q331982"

The following pages link to Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem (Q331982):

Displaying 9 items.

• Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
• A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
• Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows (Q1996750) (← links)
• Modeling and solving the multimodal car- and ride-sharing problem (Q2030528) (← links)
• Application oriented variable fixing methods for the multiple depot vehicle scheduling problem (Q2859423) (← links)
• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem (Q3134567) (← links)
• A branch and bound algorithm for the multiple depot vehicle scheduling problem (Q3826353) (← links)
• (Q4699378) (← links)
• Scheduling the vehicles of bus rapid transit systems: a case study (Q6092519) (← links)