Generalized Benders decomposition
From MaRDI portal
Publication:2550358
DOI10.1007/BF00934810zbMath0229.90024OpenAlexW2061962896MaRDI QIDQ2550358
Publication date: 1972
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934810
Related Items
A branch and bound algorithm for bi-level discrete network design problem, Hub location problems with price sensitive demands, Decomposition algorithm for large-scale two-stage unit-commitment, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Minotaur: a mixed-integer nonlinear optimization toolkit, Utility least cost planning and the Washington gas integrated model, A Benders decomposition-based framework for solving quay crane scheduling problems, Solving mixed integer nonlinear programs by outer approximation, Multiple allocation hub-and-spoke network design under hub congestion, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks, Finding maximum likelihood estimators for the three-parameter Weibull distribution, Global minimization of indefinite quadratic problems, Co-design of linear systems using generalized Benders decomposition, Decomposition based hybrid metaheuristics, Feature selection for support vector machines using generalized Benders decomposition, New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints, Benders decomposition without separability: a computational study for capacitated facility location problems, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, A Benders decomposition-based matheuristic for the cardinality constrained shift design problem, Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts, Coordinated dispatch of regional transmission organizations: theory and example, A combinatorial Benders' decomposition for the lock scheduling problem, Identifying and exploiting problem structures using explanation-based constraint programming, 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, Multiperiod optimal planning of thermal generation using cross decomposition, Continuous modular design problem: analysis and solution algorithms, Modelling the number and location of sidings on a single line railway, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A hierarchical decomposition for large-scale optimal control problems with parallel processing structure, The robust set covering problem with interval data, On solving generalized convex MINLP problems using supporting hyperplane techniques, Partitioning procedure for polynomial optimization, Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems, A mean-risk mixed integer nonlinear program for transportation network protection, Multistage system planning for hydrogen production and distribution, Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning, Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods, Extended formulations in mixed integer conic quadratic programming, A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion, A military maintenance planning and scheduling problem, Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability, Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach, Contingency planning during the formation of a supply chain, Exact and heuristic algorithms for the interval data robust assignment problem, Optimizing system resilience: a facility protection model with recovery time, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, Stochastic dual dynamic programming applied to nonconvex hydrothermal models, Tree network design avoiding congestion, Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment, Rehabilitation and replacement of water distribution system components considering uncertainties, Generalized Benders' decomposition for topology optimization problems, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, 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, Optimality tests for partitioning and sectional search algorithms, Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs, A convex analysis approach for convex multiplicative programming, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Decomposition in global optimization, Reduction of indefinite quadratic programs to bilinear programs, Group preference modeling for intelligent shared environments: social welfare beyond the sum, An algorithmic framework for convex mixed integer nonlinear programs, Distribution system planning through a generalized Benders decomposition approach, Regularized optimization methods for convex MINLP problems, Mixed-integer bilinear programming problems, Decomposition in general mathematical programming, A two-stage stochastic programming model for transportation network protection, A robust lot sizing problem with ill-known demands, A scheduling model for the daily operation of an electric power system, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes, Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems, Reformulations for utilizing separability when solving convex MINLP problems, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Integration of strategic and tactical decisions for vendor selection under capacity constraints, An interactive method as an aid in solving multi-objective mathematical programming problems, The stochastic trim-loss problem, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, Interactive search for a global optimum in macroeconometric policy- making, On the convergence of cross decomposition, A decomposition technique for discrete time optimal control problems with an application to water resources management, Dantzig-Wolfe decomposition of variational inequalities, Benders decomposition for variational inequalities, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, Mixed integer nonlinear programming tools: a practical overview, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, Different transformations for solving non-convex trim-loss problems by MINLP, An integration of efficiency projections into the Geoffrion approach for multiobjective linear programming, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Nurse scheduling on a microcomputer, Global optimization algorithms for linearly constrained indefinite quadratic problems, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, Multi-period near-equilibrium in a pool-based electricity market including on/off decisions, Primal-relaxed dual global optimization approach, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, On the identification of the optimal partition for semidefinite optimization, Genomic feature selection by coverage design optimization, A new Lagrangian-Benders approach for a concave cost supply chain network design problem, Concave minimization under linear constraints with special structure, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, Formation of a strategic manufacturing and distribution network with transfer prices, Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Improved algorithm for mixed-integer quadratic programs and a computational study, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, Stochastic Planning and Scheduling with Logic-Based Benders Decomposition, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, Unnamed Item, A decomposition approach for global optimum search in QP, NLP and MINLP problems, The application of generalized Benders decomposition to certain nonconcave programs, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, An integrated plant loading model with economies of scale and scope, Solving multiple criteria problems by interactive decomposition, A decomposition method for the min concave cost flow problem with a staircase structure, Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment, Uncontrolled inexact information within bundle methods, A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems, Minimizing the operation cost of distributed green data centers with energy storage under carbon capping, Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning, Solving multi-period interdiction via generalized Bender's decomposition, Combinatorial Benders' Cuts for the Strip Packing Problem, Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty, A Scalable Algorithm for Sparse Portfolio Selection, The multi-period multi-trip container drayage problem with release and due dates, A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines, Biconvex Models and Algorithms for Risk Management Problems, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Assembly planning by disjunctive programming and geometrical reasoning, Some Transportation Problems Under Uncertain Environments, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, The most probable allocation solution for the p-median problem, Two linear approximation algorithms for convex mixed integer nonlinear programming, A partial outer convexification approach to control transmission lines, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, A bilinear approach to the pooling problem†, A risk function for the stochastic modeling of electric capacity expansion, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, On generating maximal nondominated Benders cuts, Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems, Single-facility scheduling by logic-based Benders decomposition, Optimal engineering design via Benders' decomposition, Solution of preemptive multi-objective network design problems applying Benders decomposition method, Estimating the parameters of a fatigue model using Benders' decomposition, A decomposition approach for solving a broadcast domination network design problem, A decomposition approach to the two-stage stochastic unit commitment problem, Finding multiple optimal solutions of signomial discrete programming problems with free variables, The Benders Dual Decomposition Method, Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, Solving two-stage robust optimization problems using a column-and-constraint generation method, Logic-Based Benders Decomposition for Large-Scale Optimization, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Constraint partitioning in penalty formulations for solving temporal planning problems, Optimization of a complex flexible multibody systems with composite materials, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, Biconvex sets and optimization with biconvex functions: a survey and extensions, Decentralized Cooperative Optimization for Multi-criteria Decision Making, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN, Unnamed Item, On decomposition in bilinear programming, Portfolio selection with divisible and indivisible assets: mathematical algorithm and economic analysis, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization, Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty, Outer-approximation algorithms for nonsmooth convex MINLP problems, A nested benders decomposition approach for telecommunication network planning, Strict linear prices in non-convex European day-ahead electricity markets, A constraint generation algorithm for large scale linear programs using multiple-points separation, Manufacturing start-up problem solved by mixed-integer quadratic programming and multivariate statistical modelling, A Benders decomposition approach for the robust spanning tree problem with interval data, Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications, A local relaxation approach for the siting of electrical substations, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, Preface, Robust Critical Node Selection by Benders Decomposition, An optimization method for solving mixed discrete-continuous programming problems, Unnamed Item, Convexity and optimization with copulæ structured probabilistic constraints, On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies, Mean value cross decomposition for nonlinear convex problems, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs, Robust Optimization for Electricity Generation, Generalized primal-relaxed dual approach for global optimization, A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty, Mixed-integer quadratic programming, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, Extension of optimality conditions via supporting functions, Set covering heuristics in a benders decomposition for railway timetabling, Fill‐rate service level constrained distribution network design, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, Logic-based Benders decomposition for wildfire suppression, The bus sightseeing problem, A conflict-directed approach to chance-constrained mixed logical linear programming, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, Nonconvex sensitivity-based generalized Benders decomposition, A survey on mixed-integer programming techniques in bilevel optimization, Integrating supplier selection decisions into an inventory location problem for designing the supply chain network, A solution algorithm for chance-constrained problems with integer second-stage recourse decisions, Distributed primal outer approximation algorithm for sparse convex programming with separable structures, Natural gas production network infrastructure development under uncertainty, Unit-operation nonlinear modeling for planning and scheduling applications, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors, A disjunctive cut strengthening technique for convex MINLP, Inversion of convection-diffusion equation with discrete sources, Global optimization for molecular conformation problems, An MINLP retrofit approach for improving the flexibility of heat exchanger networks, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, A cross decomposition algorithm for a multiproduct-multitype facility location problem, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Generation expansion planning with revenue adequacy constraints, A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones, Solving dynamic stochastic economic models by mathematical programming decomposition methods, Application of Benders' decomposition to power plant preventive maintenance scheduling, Finding multiple solutions to general integer linear programs, A logic-based Benders decomposition for microscopic railway timetable planning, Mixed integer nonlinear programming tools: an updated practical overview, Optimal allocation of stock levels and stochastic customer demands to a capacitated resource, 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, Global optimization for the biaffine matrix inequality problem, Equilibrium refinement for a model of non-monocentric internal structures of cities: a potential game approach, Long range planning in the process industries: A projection approach, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Decomposition strategy for the stochastic pooling problem, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, Optimal arrangements of hyperplanes for SVM-based multiclass classification, Inexact solution of NLP subproblems in MINLP, 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, A review of deterministic optimization methods in engineering and management, Discrete optimization methods for group model selection in compressed sensing, A two-stage robust model for a reliable \(p\)-center facility location problem, Decision-dependent probabilities in stochastic programs with recourse, Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management, 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, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, Multivariate McCormick relaxations, 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, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, A survey on Benders decomposition applied to fixed-charge network design problems, 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, Cost optimization of industrial steel building structures, Outer approximation for integer nonlinear programs via decision diagrams, A scalable global optimization algorithm for stochastic nonlinear programs, 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, 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, Hierarchical MPC schemes for periodic systems using stochastic programming, A decomposition approach for optimal gas network extension with a finite set of demand scenarios, A fast exact method for the capacitated facility location problem with differentiable convex production costs, Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach, A scalable solution framework for stochastic transmission and generation planning problems, Regularized decomposition of large scale block-structured robust optimization problems, A Benders decomposition approach to product location in carousel storage systems, Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis, The maximum diversity assortment selection problem, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Heat and electricity market coordination: a scalable complementarity approach, Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints, Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables, Partially distributed outer approximation, Using regularization and second order information in outer approximation for convex MINLP, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems, A decomposition approach for stochastic shortest-path network interdiction with goal threshold, Convex minimization under Lipschitz constraints, Global optimization of measurement strategies for linear stochastic systems, Problems related to estimating the coefficients of exact penalty functions, Routing for unmanned aerial vehicles: touring dimensional sets, Towards a lifecycle oriented design of infrastructure by mathematical optimization, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, An algorithm for optimizing network flow capacity under economies of scale, Characterization of local solutions for a class of nonconvex programs, Alternative regularizations for outer-approximation algorithms for convex MINLP, Modeling and mitigating supply chain disruptions as a bilevel network flow problem, Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs, 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, A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern, Nonlinear chance-constrained problems with applications to hydro scheduling, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Cites Work
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Programming Variable Factors
- The Validity of a Family of Optimization Methods
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
