Piecewise convex formulations of binary and permutation problems

DOI10.1134/S1995423911040069zbMath1299.90266OpenAlexW2004380112MaRDI QIDQ5407698

Dominique Fortin, Ider Tseveendorj

Publication date: 7 April 2014

Published in: Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995423911040069

zbMATH Keywords

maximum cliqueDCQAPpiecewise convex

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (1)

Attractive force search algorithm for piecewise convex maximization problems

This page was built for publication: Piecewise convex formulations of binary and permutation problems