Strengthening of feasibility cuts in logic-based benders decomposition
From MaRDI portal
Publication:2117199
DOI10.1007/978-3-030-78230-6_3OpenAlexW3171972036MaRDI QIDQ2117199
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_3
logic-based benders decompositioncut strengtheningfeasibility cutsirreducible infeasible subset of constraints
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
Uses Software
Cites Work
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A matheuristic approach to large-scale avionic scheduling
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
- An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Single-facility scheduling by logic-based Benders decomposition
- Generalized filtering algorithms for infeasibility analysis
- Generalized Benders decomposition
- Logic-Based Benders Decomposition for Large-Scale Optimization
- 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
