Piecewise convex maximization approach to multiknapsack

DOI10.1080/02331930902945033zbMath1190.90160OpenAlexW2113358274MaRDI QIDQ3646095

Dominique Fortin, Ider Tseveendorj

Publication date: 19 November 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902945033

zbMATH Keywords

combinatorial optimizationlocal searchknapsackpiecewise convexnonconvex and nonsmooth problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (5)

Piece adding technique for convex maximization problems ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ A new effective dynamic program for an investment optimization problem ⋮ Piecewise convex maximization problems: Piece adding technique ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra

Cites Work

• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• A trust branching path heuristic for zero-one programming
• Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
• Global optimization and multi knapsack: a percolation algorithm.
• Piecewise-convex maximization problems: algorithm and computational experiments
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Piecewise-convex maximization problems.

This page was built for publication: Piecewise convex maximization approach to multiknapsack