Pages that link to "Item:Q2386645"

The following pages link to Partitioning procedures for solving mixed-variables programming problems. Reprint (Q2386645):

Displaying 20 items.

• Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming (Q263206) (← links)
• Mixed convexity and optimization results for an \((S-1,S)\) inventory model under a time limit on backorders (Q395687) (← links)
• Recent advances in optimization techniques for statistical tabular data protection (Q421750) (← links)
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• A heuristic block coordinate descent approach for controlled tabular adjustment (Q547141) (← links)
• Partitioning procedure for polynomial optimization (Q604960) (← links)
• A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles (Q614066) (← links)
• Computational study of the GDPO dual phase-1 algorithm (Q970138) (← links)
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
• Design of a distribution network using primal-dual decomposition (Q1793572) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• Robust optimization in power systems: a tutorial overview (Q2101660) (← links)
• Dynamic pooled capacity deployment for urban parcel logistics (Q2158021) (← links)
• Designing a two-echelon distribution network under demand uncertainty (Q2272305) (← links)
• Stochastic optimization for power system configuration with renewable energy in remote areas (Q2442098) (← links)
• (Q4917841) (← links)
• Stochastic RWA and Lightpath Rerouting in WDM Networks (Q5058011) (← links)
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)
• Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm (Q6164624) (← links)