Global optimization and multi knapsack: a percolation algorithm.

DOI10.1016/S0377-2217(02)00858-5zbMath1099.90051OpenAlexW1966446819MaRDI QIDQ1420410

Dominique Fortin, Ider Tseveendorj

Publication date: 2 February 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00858-5

zbMATH Keywords

Integer programmingGlobal optimizationCombinatorial optimizationCutting

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (5)

Reverse convex problems: an approach based on optimality conditions ⋮ The complexity results of the sparse optimization problems and reverse convex optimization problems ⋮ A trust branching path heuristic for zero-one programming ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Piecewise convex maximization approach to multiknapsack

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• On the use of cuts in reverse convex programs
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
• A genetic algorithm for the multidimensional knapsack problem
• The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• Extremal problems on complements of convex sets
• Dynamic tabu list management using the reverse elimination method
• An approach to the solution of integer optimization problems

This page was built for publication: Global optimization and multi knapsack: a percolation algorithm.