An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
type: Item
instance of: scholarly article
title: An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
zbMATH Open document ID: 1176.90669
author: Christophe Wilbaut
author: Saïd Hanafi
author: Said Salhi
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
full work available at URL: MultistartKent revised May2008 Web.pdf
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5642876
zbMATH Keywords: heuristics
zbMATH Keywords: exact methods
zbMATH Keywords: fixation techniques
zbMATH Keywords: knapsack
describes a project that uses: OR-Library
MaRDI profile type: Publication
OpenAlex ID: W2040711437
cites work: Reducing the number of variables in integer and linear programming problems
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Local branching
cites work: An effective VNS for the capacitated \(p\)-median problem
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: The Theory and Computation of Knapsack Functions
cites work: Q5692642
cites work: Q4350063
cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
cites work: Exploiting nested inequalities and surrogate constraints
cites work: Q4821303
cites work: Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
cites work: Improved results on the 0--1 multidimensional knapsack problem
cites work: Partial enumeration in heuristics for some combinatorial optimization problems
cites work: New convergent heuristics for 0-1 mixed integer programming
cites work: Q3437243
cites work: A survey of effective heuristics and their application to a variety of knapsack problems
cites work: A note on reducing the number of variables in integer programming problems
DOI: 10.1016/J.EJOR.2008.11.036
description: scientific article; zbMATH DE number 5642876