Solving constrained optimization problems by solution-based decomposition search

DOI10.1007/S10878-015-9892-8zbMATH Open1354.90141OpenAlexW821721422WikidataQ124306157 ScholiaQ124306157MaRDI QIDQ326460FDOQ326460

Authors: Amine Lamine, Mahdi Khemakhem, Habib Chabchoub, Brahim Hnich 

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

Recommendations

• Constraint decomposition algorithms in global optimization
• A general method for solving constrained optimization problems
• Publication:3484639
• A feasible decomposition method for constrained equations and its application to complementarity problems
• Decomposition method of solving a class of combinatorial optimization problems
• A hybrid method for solving general constrained optimization problems

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

• Handbook of constraint programming.
• Branch-and-Bound Methods: A Survey
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Hard multidimensional multiple choice knapsack problems, an empirical study

Cited In (3)

• Implicit constraints handling for efficient search of feasible solutions
• Title not available (Why is that?)
• Computational and Information Science

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

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