Cost Based Filtering for the Constrained Knapsack Problem

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Annals of Operations Research

• Publication date

  2002-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1021193019522
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints

  2003cited by this paper
• Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts

  2002cited by this paper
• Constraint Programming Based Column Generation for Crew Assignment

  2002cited by this paper
• Coupling Variable Fixing Algorithms for the Automatic Recording Problem

  2001influential reference
• Cutting Planes in Constraint Programming: A Hybrid Approach

  2000cited by this paper
• A Framework for Constraint Programming Based Column Generation

  1999cited by this paper
• Exact Solution of the Quadratic Knapsack Problem

  1999influential reference
• An exact algorithm for large multiple knapsack problems

  1999cited by this paper
• Cost-Based Domain Filtering

  1999cited by this paper
• Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems

  1999cited by this paper
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

  1999influential reference
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems

  1997cited by this paper
• An expanding-core algorithm for the exact 0-1 knapsack problem

  1995cited by this paper
• A Filtering Algorithm for Constraints of Difference in CSPs

  1994cited by this paper
• Knapsack Problems: Algorithms and Computer Implementations

  1990cited by this paper
• A New Algorithm for the 0-1 Knapsack Problem

  1988influential reference
• An Algorithm for Large Zero-One Knapsack Problems

  1980cited by this paper
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm

  1977influential reference
• Reduction Algorithm for Zero-One Single Knapsack Problems

  1973cited by this paper
• Discrete-Variable Extremum Problems

  1957cited by this paper

• An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem

  2025cites this paper
• Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms

  2024cites this paper
• Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning

  2024cites this paper
• Heuristics for MDD Propagation in HADDOCK

  2022cites this paper
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems

  2021cites this paper
• Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP

  2021cites this paper
• The Weighted Arborescence Constraint

  2017cites this paper
• A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing

  2017cites this paper
• Explorer Constraint programming for stochastic inventory systems under shortage cost

  2016cites this paper
• XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

  2016cites this paper
• Constraint Programming-Based Heuristics for the Multi-Depot Vehicle Routing Problem with a Rolling Planning Horizon

  2016cites this paper
• UNIVERSITÉ D'AVIGNON ET DES PAYS DE VAUCLUSE

  2015cites this paper
• General Bounding Mechanism for Constraint Programs

  2015influential citation
• Interactive Cost Configuration Over Decision Diagrams

  2014cites this paper
• Constraint Programming-based Column Generation

  2013cites this paper
• Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation

  2012cites this paper
• Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems

  2011cites this paper
• Global Constraints: A Survey

  2011cites this paper
• Constraint programming for stochastic inventory systems under shortage cost

  2011cites this paper
• Filtering Bounded Knapsack Constraints in Expected Sublinear Time

  2010cites this paper
• Approximated consistency for the automatic recording constraint

  2009cites this paper
• Constraint programming-based column generation

  2009cites this paper
• The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems

  2008cites this paper
• Length-Lex Bounds Consistency for Knapsack Constraints

  2008cites this paper
• Propagating Knapsack Constraints in Sublinear Time

  2007cites this paper
• The TV-Break Packing Problem

  2007cites this paper
• Cost-Based Filtering for Stochastic Inventory Control

  2006cites this paper
• A Cost-Regular Based Hybrid Column Generation Approach

  2006cites this paper
• Raisonnement capacitaire et élimination de variables dans les problèmes de rangement

  2006influential citation
• Towards hybrid methods for solving hard combinatorial optimization problems

  2006cites this paper
• A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming

  2006cites this paper
• Constraint Programming Based Column Generation for Employee Timetabling

  2005cites this paper
• Approximated Consistency for the Automatic Recording Problem

  2005cites this paper
• Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation

  2005cites this paper
• Branch-and-Infer: a Framework for Combining CP and IP

  2004cites this paper
• Solving VRPTWs with Constraint Programming Based Column Generation

  2004cites this paper
• The Practice of Approximated Consistency for Knapsack Constraints

  2004cites this paper
• Theoretical Foundations of CP-Based Lagrangian Relaxation

  2004cites this paper
• Stabilization Issues for Constraint Programming Based Column Generation

  2004cites this paper
• Cost-based Filtering for Shorter Path Constraints

  2003cites this paper
• Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem

  2003cites this paper
• Approximated Consistency for Knapsack Constraints

  2003cites this paper
• Reduction techniques in constraint programming and combinatorial optimization

  2002cites this paper