Pages that link to "Item:Q5191132"

The following pages link to Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network (Q5191132):

Displaying 11 items.

• A column-generation approach for joint mobilization and evacuation planning (Q890000) (← links)
• Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
• Efficient algorithms for abstract flow with partial switching (Q2079298) (← links)
• Network flow with intermediate storage: models and algorithms (Q2226495) (← 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)
• Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
• Large‐scale zone‐based evacuation planning—Part I: Models and algorithms (Q6087069) (← links)
• <scp>Large‐scale</scp> zone‐based evacuation planning, Part <scp>II</scp>: Macroscopic and microscopic evaluations (Q6087083) (← links)