Pages that link to "Item:Q323204"

The following pages link to Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204):

Displaying 24 items.

• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
• New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
• Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
• Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
• Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
• Solving minimum-cost shared arborescence problems (Q1751722) (← links)
• Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
• Multi-level facility location problems (Q1754251) (← links)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
• The Star Degree Centrality Problem: A Decomposition Approach (Q5084632) (← links)
• A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
• A bilevel “Attacker–Defender” model to choosing the composition of attack means (Q5090136) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• A new perspective on low-rank optimization (Q6052053) (← links)
• Revisiting Stackelberg p-median problem with user preferences (Q6065620) (← links)
• Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
• A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone (Q6092656) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)
• The stochastic pseudo-star degree centrality problem (Q6112539) (← links)
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)