Essays about: "irreducible infeasible subset of constraints"
Found 1 essay containing the words irreducible infeasible subset of constraints.
-
1. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem
University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : Logic-based Benders decomposition (LBBD) is a strategy for solving discrete optimisation problems. In LBBD, the optimisation problem is divided into a master problem and a subproblem and each part is solved separately. READ MORE
Result pages:
1