Pages that link to "Item:Q3821923"

The following pages link to A Column Generation Approach to the Urban Transit Crew Scheduling Problem (Q3821923):

Displaying 50 items.

• A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
• An efficient solution approach for real-world driver scheduling problems in urban bus transportation (Q351556) (← links)
• A model for bus crew scheduling problem with multiple duty types (Q714275) (← links)
• Integrated timetabling and vehicle scheduling with balanced departure times (Q747749) (← links)
• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
• A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases (Q819123) (← links)
• Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation (Q856697) (← links)
• Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport (Q857315) (← links)
• Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
• Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation (Q1017968) (← links)
• The pickup and delivery problem with time windows (Q1179004) (← links)
• Enhancing an algorithm for set covering problems (Q1194745) (← links)
• A tree search algorithm for the crew scheduling problem (Q1278340) (← links)
• Crew pairing at Air France (Q1278613) (← links)
• Aircrew schedule generation using repeated matching (Q1291572) (← links)
• Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• State space relaxation for set covering problems related to bus driver scheduling (Q1322157) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• Column generation applied to linear programs in course registration (Q1390289) (← links)
• A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
• Crew scheduling of light rail transit in Hong Kong: From modeling to implementation. (Q1406701) (← links)
• A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
• A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
• A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy (Q1617107) (← links)
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
• A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
• A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
• A column generation based hyper-heuristic to the bus driver scheduling problem (Q1723438) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
• A prototype column generation strategy for the multiple container loading problem (Q1926980) (← links)
• Modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines (Q1954542) (← links)
• A review of transport market modeling using game-theoretic principles (Q2030641) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• Distributed integral column generation for set partitioning problems (Q2139355) (← links)
• Electric bus planning \& scheduling: a review of related problems and methodologies (Q2140186) (← links)
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
• Railway crew scheduling: models, methods and applications (Q2286960) (← links)
• Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• Circulation of railway rolling stock: a branch-and-price approach (Q2384905) (← links)
• A branch-and-price approach for operational aircraft maintenance routing (Q2433558) (← links)
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem (Q2459391) (← links)
• Bi-dynamic constraint aggregation and subproblem reduction (Q2459403) (← links)
• Effective search space control for large and/or complex driver scheduling problems (Q2468754) (← links)
• Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post (Q2491777) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)