A trust branching path heuristic for zero-one programming
type: Item
instance of: scholarly article
title: A trust branching path heuristic for zero-one programming
zbMATH Open document ID: 1159.90522
published in: European Journal of Operational Research
publication date: 2009-04-30T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5549982
zbMATH Keywords: branch and bound
zbMATH Keywords: heuristics
zbMATH Keywords: multiknapsack
zbMATH Keywords: clique
author: Dominique Fortin
author: Ider Tseveendorj
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.06.033
OpenAlex ID: W2069385500
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Q4817244
cites work: Global optimization and multi knapsack: a percolation algorithm.
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: Q3993418
cites work: Q3570242
cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
DOI: 10.1016/J.EJOR.2008.06.033
description: scientific article; zbMATH DE number 5549982