Piecewise convex formulations of binary and permutation problems

DOI10.1134/S1995423911040069MaRDI QIDQ5407698zbMATH OpenOpenAlexFDO

Authors 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

DCmaximum cliquepiecewise convexQAP

Mathematics Subject Classification ID

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

Recommendations

• A convex form of the quadratic assignment problem
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• Problems on cliques and non-convex optimization
• Piecewise-convex maximization problems.
• Piecewise convex maximization approach to multiknapsack

Cited in

(1)

• Attractive force search algorithm for piecewise convex maximization problems

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

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