Pages that link to "Item:Q1764761"

The following pages link to A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem (Q1764761):

Displaying 50 items.

• Hub location problems with price sensitive demands (Q264310) (← links)
• Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
• Improving robustness of rolling stock circulations in rapid transit networks (Q337122) (← links)
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
• Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods (Q421554) (← links)
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
• Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
• Personnel scheduling: models and complexity (Q541689) (← links)
• Urban rapid transit network design: accelerated Benders decomposition (Q839775) (← links)
• An integrated aircraft routing, crew scheduling and flight retiming model (Q868987) (← links)
• Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches (Q883301) (← links)
• Integrated airline scheduling (Q947955) (← links)
• Network flow-based approaches for integrated aircraft fleeting and routing (Q958106) (← links)
• Practical enhancements to the Magnanti-Wong method (Q1003493) (← links)
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound (Q1010284) (← links)
• An iterative approach to robust and integrated aircraft routing and crew scheduling (Q1046695) (← links)
• Preemptive rerouting of airline passengers under uncertain delays (Q1652495) (← links)
• Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem (Q1674899) (← links)
• A compact optimization model for the tail assignment problem (Q1681506) (← links)
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) (← links)
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Solving shortest path problems with a weight constraint and replenishment arcs (Q1762066) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (Q2183874) (← links)
• Alternating Lagrangian decomposition for integrated airline crew scheduling problem (Q2189931) (← links)
• Dynamic constraint aggregation for solving very large-scale airline crew pairing problems (Q2226471) (← links)
• Operational aircraft maintenance routing problem with remaining time consideration (Q2256235) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (Q2327625) (← links)
• A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern (Q2355861) (← links)
• Solving a large-scale integrated fleet assignment and crew pairing problem (Q2399331) (← links)
• A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system (Q2434331) (← links)
• On generating maximal nondominated Benders cuts (Q2442075) (← links)
• A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
• Simultaneous fleet assignment and cargo routing using Benders decomposition (Q2507572) (← links)
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Optimization of the integrated problem of employee timetabling and job shop scheduling (Q2669607) (← links)
• A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem (Q2669651) (← links)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
• Integrated airline schedule design and fleet assignment: polyhedral analysis and Benders' decomposition approach (Q2899083) (← links)
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling (Q4411201) (← links)
• Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← links)
• Vessel Service Planning in Seaports (Q5106352) (← links)
• The Aircraft Maintenance Routing Problem (Q5902161) (← links)
• A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
• Optimizing integrated aircraft assignment and turnaround handling (Q6113450) (← links)