Pages that link to "Item:Q1131201"
From MaRDI portal
The following pages link to Partitioning procedures for solving mixed-variables programming problems (Q1131201):
Displaying 50 items.
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming (Q263206) (← links)
- Hub location problems with price sensitive demands (Q264310) (← links)
- Projection, consistency, and George Boole (Q265702) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks (Q299776) (← links)
- An optimization framework for the development of efficient one-way car-sharing systems (Q300047) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Feature selection for support vector machines using generalized Benders decomposition (Q319318) (← links)
- Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
- Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778) (← links)
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- A model enhancement heuristic for building robust aircraft maintenance personnel rosters with stochastic constraints (Q319839) (← links)
- Coordinating decentralized linear programs by exchange of primal information (Q320089) (← links)
- Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
- Optimal investment plan for dynamic thermal rating using Benders decomposition (Q320810) (← links)
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
- On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs (Q320895) (← links)
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
- Maintenance scheduling in the electricity industry: a literature review (Q322753) (← links)
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
- Supplier selection in the processed food industry under uncertainty (Q322981) (← 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)
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals (Q323449) (← links)
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design (Q336890) (← links)
- Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
- A combinatorial Benders' decomposition for the lock scheduling problem (Q337348) (← links)
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- A decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547) (← links)
- Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches (Q337653) (← links)
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty (Q342259) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model (Q342516) (← links)
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- Multiperiod optimal planning of thermal generation using cross decomposition (Q353701) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- A classification of methods for distributed system optimization based on formulation structure (Q381334) (← links)
- Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
