Benders decomposition: Solving binary master problems by enumeration
نویسندگان
چکیده
منابع مشابه
A Benders decomposition based framework for solving cable trench problems
In this work, we present an algorithmic framework based on Benders decomposition for the Capacitated p-Cable Trench Problem with Covering. We show that our approach can be applied to most variants of the Cable Trench Problem (CTP) that have been considered in the literature. The proposed algorithm is augmented with a stabilization procedure to accelerate the convergence of the cut loop and with...
متن کاملBenders Decomposition for Mixed- Integer Hydrothermal Problems by Lagrangean Relaxation
Decomposition models with integer variables usually decompose into a master problem that comprises all the integer variables and subproblems, which evaluate the remaining variables. Subproblems with integer variables introduce additional difficulties and require the use of nonlinear duality theory. In this paper we address the solution of a mixed integer hydrothermal coordination problem combin...
متن کاملAccelerating Benders Decomposition with Heuristic Master Problem Solutions
In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show t...
متن کاملAccelerating Benders Decomposition with Heuristic Master Problem Solutions
In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show t...
متن کاملSolving mixed-integer robust optimization problems with interval uncertainty using Benders decomposition
Sauleh Siddiqui*, Steven A Gabriel and Shapour Azarm Johns Hopkins University, Baltimore, MD, USA; Department of Civil Engineering, Applied Mathematics & Statistics, and Scientific Computation Program, University of Maryland, College Park, MD, USA; and Department of Mechanical Engineering, Applied Mathematics & Statistics, and Scientific Computation Program, University of Maryland, College Park...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2016
ISSN: 0167-6377
DOI: 10.1016/j.orl.2015.11.009