The following pages link to Generalized Benders decomposition (Q2550358):
Displaying 50 items.
- A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
- Hub location problems with price sensitive demands (Q264310) (← links)
- Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks (Q299776) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Feature selection for support vector machines using generalized Benders decomposition (Q319318) (← links)
- New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints (Q320803) (← 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)
- Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts (Q336606) (← links)
- Coordinated dispatch of regional transmission organizations: theory and example (Q336819) (← links)
- A combinatorial Benders' decomposition for the lock scheduling problem (Q337348) (← 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)
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- Optimizing system resilience: a facility protection model with recovery time (Q439415) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models (Q439570) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- Group preference modeling for intelligent shared environments: social welfare beyond the sum (Q506766) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Multistage system planning for hydrogen production and distribution (Q613565) (← links)
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Decomposition in general mathematical programming (Q689140) (← links)
- A robust lot sizing problem with ill-known demands (Q690887) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Interactive search for a global optimum in macroeconometric policy- making (Q751476) (← links)
- On the convergence of cross decomposition (Q752000) (← links)
- A decomposition technique for discrete time optimal control problems with an application to water resources management (Q752470) (← links)
- Benders decomposition for variational inequalities (Q757226) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization (Q779756) (← links)
- An integration of efficiency projections into the Geoffrion approach for multiobjective linear programming (Q790048) (← links)
- Nurse scheduling on a microcomputer (Q807414) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
