Pages that link to "Item:Q3904383"

The following pages link to Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria (Q3904383):

Displaying 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)
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
• Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
• New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints (Q320803) (← links)
• Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
• Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles (Q322758) (← links)
• Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
• Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
• A Benders decomposition-based matheuristic for the cardinality constrained shift design problem (Q323346) (← links)
• Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
• Model building using bi-level optimization (Q620522) (← links)
• Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Mixed-integer bilinear programming problems (Q687032) (← links)
• Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization (Q779756) (← links)
• An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem (Q853803) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• An integrated model for logistics network design (Q867539) (← links)
• An integrated aircraft routing, crew scheduling and flight retiming model (Q868987) (← links)
• Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• Integrated airline scheduling (Q947955) (← links)
• Practical enhancements to the Magnanti-Wong method (Q1003493) (← links)
• Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
• A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
• Capital budgeting with Benders' decomposition (Q1062887) (← links)
• Locational analysis (Q1173002) (← links)
• A robustness approach to uncapacitated network design problems (Q1278322) (← links)
• On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325) (← links)
• On using approximations of the Benders master problem (Q1333479) (← links)
• Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
• A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
• A two-stage stochastic programming approach for multi-activity tour scheduling (Q1683088) (← links)
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← 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)
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← links)