Sökning: "Logic-based Benders decomposition"
Hittade 2 uppsatser innehållade orden Logic-based Benders decomposition.
1. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem
Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : 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. LÄS MER
2. Scheduling of an underground mine by combining logic based Benders decomposition and a constructive heuristic
Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : Underground mining is a complex operation that requires careful planning. The short-term scheduling, which is the scheduling of the tasks involved in the excavation process, is an important part of the planning process. LÄS MER
Resultatsidor:
1