Pages that link to "Item:Q5943075"

The following pages link to A geometric study of dual gaps, with applications (Q5943075):

Displaying 29 items.

• Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
• Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• Stochastic dual dynamic programming applied to nonconvex hydrothermal models (Q439570) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
• Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
• Duality gaps in nonconvex stochastic optimization (Q1764248) (← links)
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
• Solving the short-term scheduling problem of hydrothermal systems via Lagrangian relaxation and augmented Lagrangian (Q1955275) (← links)
• Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
• On decomposition and multiobjective-based column and disjunctive cut generation for MINLP (Q2129200) (← links)
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• On a primal-proximal heuristic in discrete optimization (Q2571002) (← links)
• A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
• Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
• Incremental Bundle Methods using Upper Models (Q4603045) (← links)
• Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization (Q5359499) (← links)
• The omnipresence of Lagrange (Q5920487) (← links)
• A Unified Framework for Pricing in Nonconvex Resource Allocation Games (Q6114782) (← links)