Multiple-choice knapsack constraint in graphical models
From MaRDI portal
Publication:2170205
DOI10.1007/978-3-031-08011-1_19zbMATH Open1504.90130OpenAlexW4281744407MaRDI QIDQ2170205FDOQ2170205
George Katsirelos, Simon de Givry, Pierre Montalbano
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_19
Recommendations
- Triangle-based consistencies for cost function networks
- Soft arc consistency revisited
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Approximated consistency for knapsack constraints
Cites Work
- Title not available (Why is that?)
- Soft arc consistency revisited
- Title not available (Why is that?)
- Radio link frequency assignment
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Computational protein design as an optimization problem
- Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction
- Tractability-preserving transformations of global cost functions
- An O(n) algorithm for the multiple-choice knapsack linear program
- Mini-buckets
- Bounds Arc Consistency for Weighted CSPs
- Title not available (Why is that?)
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- A note on the knapsack problem with special ordered sets
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Graphical Models: Queries, Complexity, Algorithms
- Explanation-based weighted degree
- A Guided Tour of Artificial Intelligence Research
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Relaxation-aware heuristics for exact optimization in graphical models
Uses Software
This page was built for publication: Multiple-choice knapsack constraint in graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170205)
