Generalized Benders decomposition
From MaRDI portal
Publication:2550358
Cites work
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- Partitioning procedures for solving mixed-variables programming problems
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
- Programming Variable Factors
- The Validity of a Family of Optimization Methods
Cited in
(only showing first 100 items - show all)- The stochastic trim-loss problem
- Dantzig-Wolfe decomposition of variational inequalities
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Global minimization of indefinite quadratic problems
- A hierarchical decomposition for large-scale optimal control problems with parallel processing structure
- Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems
- Optimality tests for partitioning and sectional search algorithms
- Decomposition in global optimization
- Reduction of indefinite quadratic programs to bilinear programs
- Distribution system planning through a generalized Benders decomposition approach
- A scheduling model for the daily operation of an electric power system
- An interactive method as an aid in solving multi-objective mathematical programming problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Primal-relaxed dual global optimization approach
- Utility least cost planning and the Washington gas integrated model
- Solving mixed integer nonlinear programs by outer approximation
- Finding maximum likelihood estimators for the three-parameter Weibull distribution
- Modelling the number and location of sidings on a single line railway
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- A Benders decomposition-based framework for solving quay crane scheduling problems
- Co-design of linear systems using generalized Benders decomposition
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- A global optimization for sustainable multi-domain global manufacturing
- Benders decomposition for curriculum-based course timetabling
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- A mean-risk mixed integer nonlinear program for transportation network protection
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Extended formulations in mixed integer conic quadratic programming
- Contingency planning during the formation of a supply chain
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
- Product costing in the strategic formation of a supply chain
- Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- The Benders decomposition algorithm: a literature review
- A new cross decomposition method for stochastic mixed-integer linear programming
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- A survey on Benders decomposition applied to fixed-charge network design problems
- Mixed integer programming for a special logic constrained optimal control problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Benders decomposition: solving binary master problems by enumeration
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- A scalable solution framework for stochastic transmission and generation planning problems
- Regularized decomposition of large scale block-structured robust optimization problems
- Convex minimization under Lipschitz constraints
- Global optimization of measurement strategies for linear stochastic systems
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors
- Global optimization for the biaffine matrix inequality problem
- Long range planning in the process industries: A projection approach
- Decomposition strategy for the stochastic pooling problem
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
- Inexact solution of NLP subproblems in MINLP
- A review of deterministic optimization methods in engineering and management
- A two-stage robust model for a reliable p-center facility location problem
- Decision-dependent probabilities in stochastic programs with recourse
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- Global optimization of multilevel electricity market models including network design and graph partitioning
- Outer approximation for integer nonlinear programs via decision diagrams
- Exact solution techniques for two-dimensional cutting and packing
- The multiple multidimensional knapsack with family-split penalties
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- The maximum diversity assortment selection problem
- Partially distributed outer approximation
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- Routing for unmanned aerial vehicles: touring dimensional sets
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Modeling and mitigating supply chain disruptions as a bilevel network flow problem
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- An outer-approximation guided optimization approach for constrained neural network inverse problems
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Non-convex nested Benders decomposition
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Strengthening of feasibility cuts in logic-based benders decomposition
- Nonlinear chance-constrained problems with applications to hydro scheduling
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A disjunctive cut strengthening technique for convex MINLP
- Inversion of convection-diffusion equation with discrete sources
- Generation expansion planning with revenue adequacy constraints
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
- A logic-based Benders decomposition for microscopic railway timetable planning
- The supporting hyperplane optimization toolkit for convex MINLP
- The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Equilibrium refinement for a model of non-monocentric internal structures of cities: a potential game approach
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Optimal arrangements of hyperplanes for SVM-based multiclass classification
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Asynchronous level bundle methods
- Certifiably optimal sparse inverse covariance estimation
- Discrete optimization methods for group model selection in compressed sensing
- Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management
This page was built for publication: Generalized Benders decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2550358)
