Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
type: Item
instance of: scholarly article
title: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
zbMATH Open document ID: 1141.90512
author: Mhand Hifi
author: M. Michrafy
published in: Computers \& Operations Research
publication date: 2007-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5142327
zbMATH Keywords: branch and bound
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: dichotomous search
zbMATH Keywords: knapsacks
zbMATH Keywords: reduction strategies
zbMATH Keywords: valid cuts
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2005.10.004
OpenAlex ID: W2084894096
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: The Theory and Computation of Knapsack Functions
cites work: Q4821303
cites work: Q3993418
cites work: Q4198056
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
cites work: A reactive local search-based algorithm for the disjunctively constrained knapsack problem
cites work: Q4054818
cites work: Discrete-Variable Extremum Problems
DOI: 10.1016/J.COR.2005.10.004
description: scientific article; zbMATH DE number 5142327