Pages that link to "Item:Q1888181"

The following pages link to An exact algorithm for the simplified multiple depot crew scheduling problem (Q1888181):

Displaying 9 items.

• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• Railway crew scheduling: models, methods and applications (Q2286960) (← links)
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
• Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models (Q5080634) (← links)
• A General Branch-and-Cut Framework for Rotating Workforce Scheduling (Q5087722) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG (Q6201534) (← links)