Strengthening of feasibility cuts in logic-based benders decomposition
From MaRDI portal
Publication:2117199
DOI10.1007/978-3-030-78230-6_3OpenAlexW3171972036MaRDI QIDQ2117199FDOQ2117199
Authors: Emil Karlsson, Elina Rönnberg 
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Generalized Benders decomposition
- Planning and Scheduling by Logic-Based Benders Decomposition
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Title not available (Why is that?)
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Single-facility scheduling by logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- Principles and Practice of Constraint Programming – CP 2004
- Generalized filtering algorithms for infeasibility analysis
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
- Logic-based Benders decomposition for large-scale optimization
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A matheuristic approach to large-scale avionic scheduling
Cited In (2)
Uses Software
This page was built for publication: Strengthening of feasibility cuts in logic-based benders decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117199)
