Solving constrained optimization problems by solution-based decomposition search

DOI10.1007/s10878-015-9892-8zbMath1354.90141OpenAlexW821721422WikidataQ124306157 ScholiaQ124306157MaRDI QIDQ326460

Habib Chabchoub, Mahdi Khemakhem, Brahim Hnich, Amine Lamine

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9892-8

zbMATH Keywords

exact algorithmconstrained optimization problemdecomposition search

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Hard multidimensional multiple choice knapsack problems, an empirical study
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Branch-and-Bound Methods: A Survey
• Unnamed Item

This page was built for publication: Solving constrained optimization problems by solution-based decomposition search