Pages that link to "Item:Q1003493"
From MaRDI portal
The following pages link to Practical enhancements to the Magnanti-Wong method (Q1003493):
Displayed 50 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)
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
- Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
- Integrated airline scheduling (Q947955) (← links)
- Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
- A two-stage stochastic programming approach for multi-activity tour scheduling (Q1683088) (← links)
- Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
- An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Multicommodity flows and Benders decomposition for restricted continuous location problems (Q1754155) (← links)
- Service location grouping and pricing in transportation: application in air cargo (Q1754269) (← links)
- Benders decomposition for the Hazmat transport network design problem (Q1754275) (← links)
- A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
- An improved L-shaped method for solving process flexibility design problems (Q1793161) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure (Q2029964) (← links)
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems (Q2074837) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
- Enhancing Benders decomposition algorithm to solve a combat logistics problem (Q2178915) (← links)
- A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (Q2183874) (← links)
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← links)
- Scheduled service network design with resource management for two-tier multimodal city logistics (Q2239992) (← links)
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing (Q2242251) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks (Q2289916) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- Accelerating Benders decomposition: multiple cuts via multiple solutions (Q2424650) (← links)
- On generating maximal nondominated Benders cuts (Q2442075) (← links)
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach (Q2442080) (← links)
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
- Stochastic optimization for power system configuration with renewable energy in remote areas (Q2442098) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)