Multiple-choice knapsack constraint in graphical models
From MaRDI portal
Publication:2170205
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
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- scientific article; zbMATH DE number 2080322 (Why is no real title available?)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- A Guided Tour of Artificial Intelligence Research
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A note on the knapsack problem with special ordered sets
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An O(n) algorithm for the multiple-choice knapsack linear program
- Bounds arc consistency for weighted CSPs
- Computational protein design as an optimization problem
- Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- Explanation-based weighted degree
- Graphical Models: Queries, Complexity, Algorithms
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Mini-buckets: a general scheme for bounded inference
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Probabilistic graphical models.
- Radio link frequency assignment
- Relaxation-aware heuristics for exact optimization in graphical models
- Soft arc consistency revisited
- Tractability-preserving transformations of global cost functions
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)
