Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling
From MaRDI portal
Publication:2676319
DOI10.1016/j.cor.2022.105916OpenAlexW4283518553MaRDI QIDQ2676319
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105916
constraint programmingmixed-integer programmingacceleration techniquelogic-based benders decompositioncut strengtheningavionics scheduling
Related Items
Uses Software
Cites Work
- Unnamed Item
- Decomposition based hybrid metaheuristics
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Logic-based Benders decomposition
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- A Benders decomposition-based framework for solving quay crane scheduling problems
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Strengthening of feasibility cuts in logic-based benders decomposition
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A matheuristic approach to large-scale avionic scheduling
- An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
- Logic-based Benders decomposition for scheduling a batching machine
- Single-facility scheduling by logic-based Benders decomposition
- Generalized filtering algorithms for infeasibility analysis
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Principles and Practice of Constraint Programming – CP 2004