Pages that link to "Item:Q2442074"

The following pages link to An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074):

Displayed 22 items.

• Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) ‎ (← links)
• Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) ‎ (← links)
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) ‎ (← links)
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) ‎ (← links)
• A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) ‎ (← links)
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) ‎ (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) ‎ (← links)
• Benders decomposition: solving binary master problems by enumeration (Q1785474) ‎ (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) ‎ (← links)
• Design and implementation of a modular interior-point solver for linear optimization (Q2062319) ‎ (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) ‎ (← links)
• The rank pricing problem with ties (Q2239986) ‎ (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) ‎ (← links)
• An accelerated L-shaped method for solving two-stage stochastic programs in disaster management (Q2288985) ‎ (← links)
• Accelerating Benders decomposition: multiple cuts via multiple solutions (Q2424650) ‎ (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) ‎ (← links)
• A Benders decomposition algorithm for demand-driven metro scheduling (Q2669703) ‎ (← links)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) ‎ (← links)
• Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) ‎ (← links)
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) ‎ (← links)
• The Benders Dual Decomposition Method (Q5130513) ‎ (← links)
• Learning Optimized Risk Scores (Q5214243) ‎ (← links)