Pages that link to "Item:Q4545655"

The following pages link to A Set Partitioning Approach to the Crew Scheduling Problem (Q4545655):

Displaying 28 items.

• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price (Q339594) (← links)
• A hybrid soft computing approach for subset problems (Q474017) (← links)
• Solving the constrained shortest path problem using random search strategy (Q546424) (← links)
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care (Q819093) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows (Q1013387) (← links)
• An extension of set partitioning with application to scheduling problems (Q1060959) (← links)
• On the integer properties of scheduling set partitioning models (Q1100095) (← links)
• A tree search algorithm for the crew scheduling problem (Q1278340) (← links)
• A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation (Q1761961) (← links)
• An exact algorithm for the simplified multiple depot crew scheduling problem (Q1888181) (← links)
• Railway crew scheduling: models, methods and applications (Q2286960) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem (Q2459391) (← links)
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
• Engine scheduling by column generation (Q2740904) (← links)
• A survey of resource constrained shortest path problems: exact solution approaches (Q2811308) (← links)
• A Multiplier Adjustment Approach for the Set Partitioning Problem (Q3990562) (← links)
• (Q4357010) (← links)
• Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models (Q5080634) (← links)
• Progress in Artificial Intelligence (Q5191553) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
• A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
• Public transport for smart cities: recent innovations and future challenges (Q6106754) (← links)
• New partitioning techniques and faster algorithms for approximate interval scheduling (Q6614114) (← links)