Pages that link to "Item:Q2783880"

The following pages link to A Benders Decomposition Approach for the Locomotive and Car Assignment Problem (Q2783880):

Displaying 37 items.

• Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
• Hub location problems with price sensitive demands (Q264310) (← links)
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
• A general rapid network design, line planning and fleet investment integrated model (Q512985) (← links)
• Robust rolling stock in rapid transit networks (Q632646) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches (Q883301) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• Practical enhancements to the Magnanti-Wong method (Q1003493) (← links)
• Integrated approach to network design and frequency setting problem in railway rapid transit systems (Q1652202) (← links)
• Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem (Q1674899) (← links)
• Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
• Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
• Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach (Q1730814) (← links)
• Integration of timetable planning and rolling stock in rapid transit networks (Q1761752) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• A new convergent hybrid learning algorithm for two-stage stochastic programs (Q2286915) (← links)
• Circulation of railway rolling stock: a branch-and-price approach (Q2384905) (← links)
• Speed-up Benders decomposition using maximum density cut (MDC) generation (Q2442077) (← links)
• Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach (Q2442080) (← 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)
• Optimal engineering design via Benders' decomposition (Q2442087) (← links)
• Estimating the parameters of a fatigue model using Benders' decomposition (Q2442091) (← links)
• A Lagrangian heuristic for a train-unit assignment problem (Q2446297) (← links)
• A rolling stock circulation model for combining and splitting of passenger trains (Q2503094) (← links)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
• Solving a real-world train-unit assignment problem (Q2638371) (← links)
• A time-space formulation for the locomotive routing problem at the Canadian National Railways (Q2669796) (← links)
• A SEARCH-BASED APPROACH TO RAILWAY ROLLING STOCK ALLOCATION PROBLEMS (Q2905277) (← links)
• Effective material flow at an assembly facility (Q3168925) (← links)
• The locomotive assignment problem: a survey on optimization models (Q4979995) (← links)
• Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints (Q5240130) (← links)
• Operations Research in passenger railway transportation (Q5438545) (← links)
• Locomotive assignment and freight train scheduling using genetic algorithms (Q5489127) (← links)