Pages that link to "Item:Q3392098"
From MaRDI portal
The following pages link to Planning and Scheduling by Logic-Based Benders Decomposition (Q3392098):
Displaying 33 items.
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Two-level decomposition algorithm for crew rostering problems with fair working condition (Q2514878) (← links)
- Assembly planning by disjunctive programming and geometrical reasoning (Q2669707) (← links)
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
- Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
- Decomposition methods for the parallel machine scheduling problem with setups (Q2806866) (← links)
- Robust Scheduling with Logic-Based Benders Decomposition (Q2806901) (← links)
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
- Benders' cuts guided large neighborhood search for the traveling umpire problem (Q2892136) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint (Q2947228) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Logic-based MultiObjective Optimization for Restoration Planning (Q3638509) (← links)
- Collaborative Operating Room Planning and Scheduling (Q4599323) (← links)
- Optimal Torpedo Scheduling (Q4611395) (← links)
- Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos (Q4905627) (← links)
- Stochastic Planning and Scheduling with Logic-Based Benders Decomposition (Q5057988) (← links)
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition (Q5084654) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem (Q5086007) (← links)
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems (Q5106415) (← links)
- Toward unification of exact and heuristic optimization methods (Q5246819) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900291) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900301) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut (Q6096622) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems (Q6572836) (← links)
- Bayer digestion maintenance optimisation with lazy constraints and Benders decomposition (Q6588482) (← links)
