Strengthening of feasibility cuts in logic-based benders decomposition
From MaRDI portal
Publication:2117199
Cites work
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- 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
- Generalized Benders decomposition
- Generalized filtering algorithms for infeasibility analysis
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Logic-based Benders decomposition
- Logic-based Benders decomposition for large-scale optimization
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Principles and Practice of Constraint Programming – CP 2004
- Single-facility scheduling by logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
Cited in
(2)
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)