Approximated consistency for knapsack constraints

DOI10.1007/B13743MaRDI QIDQ5897222zbMATH OpenOpenAlexFDO

Authors Meinolf Sellmann

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

zbMATH Keywords

approximation algorithmscost-based filteringglobal constraintsoptimization constraintsrelaxed consistency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A dynamic programming approach for consistency and propagation for knapsack constraints
• Filtering algorithms for the NValue constraint
• Cost based filtering for the constrained knapsack problem
• Approximation for knapsack problems with multiple constraints
• scientific article; zbMATH DE number 2080322

Cited in

(10)

• Approximated consistency for the automatic recording constraint
• Cost based filtering for the constrained knapsack problem
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Multiple-choice knapsack constraint in graphical models
• Cost-based filtering for shorter path constraints
• The complexity of reasoning with global constraints
• Bucket elimination for multiobjective optimization problems
• Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
• Using local search to speed up filtering algorithms for some NP-hard constraints
• Complete bound consistency for the global cardinality constraint

This page was built for publication: Approximated consistency for knapsack constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897222)