Partitioning procedures for solving mixed-variables programming problems. Reprint
From MaRDI portal
Publication:2386645
Cited in
(29)- Mixed convexity and optimization results for an \((S-1,S)\) inventory model under a time limit on backorders
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Robust optimization in power systems: a tutorial overview
- Computational study of the GDPO dual phase-1 algorithm
- Design of a distribution network using primal-dual decomposition
- Managing oversaturation in BRT corridors: a new approach of timetabling for resilience enhancement using a tailored integer L-shaped algorithm
- Stochastic optimization for power system configuration with renewable energy in remote areas
- Stochastic RWA and lightpath rerouting in WDM networks
- Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
- Partitioning procedure for polynomial optimization
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- Designing a two-echelon distribution network under demand uncertainty
- Multi-cycle production network design under supply uncertainty
- The maximum diversity assortment selection problem
- Recent advances in optimization techniques for statistical tabular data protection
- Dynamic pooled capacity deployment for urban parcel logistics
- ASP-based approaches for solving the nuclear medicine scheduling problem
- Diversification or pooling? Distributionally robust optimization approach for closed-loop supply chain network design
- Improved Benders decomposition for home healthcare vehicle and drone routing problem in two-echelon supply chains
- A heuristic block coordinate descent approach for controlled tabular adjustment
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
- Integrated operating room scheduling and surgical instrument inventory management: models, algorithms, and cost-saving insights
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- Jacques Benders and his decomposition algorithm
- scientific article; zbMATH DE number 6160116 (Why is no real title available?)
- Neural Benders decomposition for mixed-integer programming
- A novel hybrid PSO-heuristic algorithm with combinatorial Benders' cuts for maximal evacuation planning in wildfire disasters
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
This page was built for publication: Partitioning procedures for solving mixed-variables programming problems. Reprint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386645)
