A trust branching path heuristic for zero-one programming

DOI10.1016/j.ejor.2008.06.033zbMath1159.90522OpenAlexW2069385500MaRDI QIDQ1014935

Dominique Fortin, Ider Tseveendorj

Publication date: 30 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.06.033

zbMATH Keywords

heuristicsbranch and boundcliquemultiknapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Piecewise convex maximization approach to multiknapsack ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation

Cites Work

• A genetic algorithm for the multidimensional knapsack problem
• Global optimization and multi knapsack: a percolation algorithm.
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A trust branching path heuristic for zero-one programming