Partitioning procedures for solving mixed-variables programming problems

1962/12/01 by J. F. Benders · 40 citations
Engineering · Mathematics · #Optimization and Packing Problems #Advanced Optimization Algorithms Research #Advanced Theoretical and Applied Studies in Material Sciences and Geometry

paper · doi:10.1007/bf01386316

Cited by

• Planning and Scheduling by Logic-Based Benders Decomposition
• A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
• The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty
• Improving Decision Quality for Energy System Design via Stochastic Goal Programming with Data-Driven MILPs
• State-of-the-art review of optimization methods for short-term scheduling of batch processes
• Learning Optimal Classification Trees: Strong Max-Flow Formulations
• A Decomposition Based Approach for Solving a General Bilevel Linear Programming
• A Stabilizing Control Algorithm for Asynchronous Parallel Quadratic\n Programming via Dual Decomposition
• A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem
• Graph-Based Imitation and Reinforcement Learning for Efficient Benders Decomposition
• Integrated planning of vertiports and vertipads infrastructure for Urban Air Mobility
• A two-level distributed algorithm for nonconvex constrained optimization
• Stabilized Benders decomposition for energy planning under climate uncertainty
• KKT Conditions, First-Order and Second-Order Optimization, and Distributed Optimization: Tutorial and Survey
• Railway disruption management: Designing bus bridging services under uncertainty
• An Outer-approximation Guided Optimization Approach for Constrained Neural Network Inverse Problems
• A hybrid solution approach for the Integrated Healthcare Timetabling Competition 2024
• Resource-dependent process times in hybrid flexible flowshops
• Improving Fast Dual Ascent for MPC - Part I: The Distributed Case
• Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
• Deepest Cuts for Benders Decomposition
• Harvest-or-Transmit Policy for Cognitive Radio Networks: A Learning\n Theoretic Approach
• On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
• Decomposition Algorithms for Stochastic Programming on a Computational Grid
• Massively Parallel Benders Decomposition for Correlation Clustering
• Regret-based Reward Elicitation for Markov Decision Processes
• Learning to control inexact Benders decomposition via reinforcement learning
• A Mathematical Programming approach to Binary Supervised Classification with Label Noise
• Robust linear control of nonconvex battery operation in transmission systems
• ILP Modulo Theories
• Aircraft Loading Optimization: MemComputing the 5th Airbus Problem
• Inexact cuts for Deterministic and Stochastic Dual Dynamic Programming applied to convex nonlinear optimization problems
• Large-scale optimization with the primal-dual column generation method
• Meta Partial Benders Decomposition for the Logistics Service Network\n Design Problem
• Scalable Power System Line Upgrade Planning With Policy Constraints: A\n "Branch and Benders" Approach
• A Status Report on Conflict Analysis in Mixed Integer Nonlinear\n Programming
• Efficient Multi-Person Pose Estimation with Provable Guarantees
• Accelerating Generalized Benders Decomposition for Wireless Resource Allocation
• Large-scale Unit Commitment under uncertainty
• Robust production planning with budgeted cumulative demand uncertainty