The maximum ratio clique problem: A continuous optimization approach and some new results

DOI10.1007/978-3-319-18161-5_19MaRDI QIDQ5356986zbMATH OpenOpenAlexFDO

Authors Mahdi Moeini

Publication date 12 September 2017

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18161-5_19

zbMATH Keywords

DCAfractional programmingDC programmingmaximum ratio clique problem

Mathematics Subject Classification ID

Fractional programming (90C32) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Portfolio theory (91G10) Mixed integer programming (90C11) Boolean programming (90C09)

Recommendations

• The maximum ratio clique problem
• A variable neighborhood search heuristic for the maximum ratio clique problem
• On a continuous approach for the maximum weighted clique problem
• Solution of the clique problem by reducing it to a problem with a d.c. constraint
• Problems on cliques and non-convex optimization

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3197631 (Why is no real title available?)
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• A Novel Efficient Approach for Solving the Art Gallery Problem
• A continuous approch for globally solving linearly constrained quadratic
• A note on a global approach for general 0-1 fractional programming
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA for globally solving the value-at-risk
• DC programming approach for portfolio optimization under step increasing transaction costs
• Exact penalty and error bounds in DC programming
• Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
• Mining market data: a network approach
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Parametric approaches to fractional programs
• Robust investment strategies with discrete asset choice constraints using DC programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The maximum ratio clique problem

Cited in

(7)

• On a continuous approach for the maximum weighted clique problem
• Solving the index tracking problem: a continuous optimization approach
• Solution of the clique problem by reducing it to a problem with a d.c. constraint
• Fractional 0-1 programming: applications and algorithms
• A variable neighborhood search heuristic for the maximum ratio clique problem
• On maximum ratio clique relaxations
• The maximum ratio clique problem

This page was built for publication: The maximum ratio clique problem: A continuous optimization approach and some new results

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