A trust branching path heuristic for zero-one programming

DOI10.1016/J.EJOR.2008.06.033MaRDI QIDQ1014935zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Zero-one integer programs with few constraints - Efficient branch and bound algorithms
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• A trust branching path heuristic for permutation problems
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben

Cites work

• scientific article; zbMATH DE number 5726469 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2102015 (Why is no real title available?)
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A genetic algorithm for the multidimensional knapsack problem
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Global optimization and multi knapsack: a percolation algorithm.
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1

Cited in

(5)

• A trust branching path heuristic for permutation problems
• Piecewise convex maximization approach to multiknapsack
• Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
• Zero-one integer programs with few constraints - Efficient branch and bound algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014935)