Pages that link to "Item:Q323204"
From MaRDI portal
The following pages link to Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204):
Displaying 50 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)
- Solving the facility location and fixed charge solid transportation problem (Q1983711) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- On single-source capacitated facility location with cost and fairness objectives (Q2029269) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
- Benders' decomposition for the balancing of assembly lines with stochastic demand (Q2030547) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- Modeling and mitigating supply chain disruptions as a bilevel network flow problem (Q2090114) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics (Q2103001) (← links)
- Pricing and collection rate for remanufacturing industry considering capacity constraint in recycling channels (Q2196166) (← links)
- Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems (Q2242249) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- Joint location and pricing within a user-optimized environment (Q2308187) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Benders decomposition for a node-capacitated virtual network function placement and routing problem (Q2668658) (← links)
- Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness (Q2668664) (← links)
- Benders decomposition for a period-aggregated resource leveling problem with variable job duration (Q2668707) (← links)
- Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster (Q2668769) (← links)
- Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs (Q2668783) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← 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 Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← 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)
