The maximum ratio clique problem: A continuous optimization approach and some new results
DOI10.1007/978-3-319-18161-5_19zbMATH Open1370.90197OpenAlexW791074792MaRDI QIDQ5356986FDOQ5356986
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
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
Fractional programming (90C32) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Portfolio theory (91G10) Mixed integer programming (90C11) Boolean programming (90C09)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Mining market data: a network approach
- Title not available (Why is that?)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
- A note on a global approach for general 0-1 fractional programming
- Title not available (Why is that?)
- On complexity of unconstrained hyperbolic 0--1 programming problems
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Exact penalty and error bounds in DC programming
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- A continuous approch for globally solving linearly constrained quadratic
- Parametric approaches to fractional programs
- DC programming approach for portfolio optimization under step increasing transaction costs
- A Novel Efficient Approach for Solving the Art Gallery Problem
- DC programming and DCA for globally solving the value-at-risk
- The maximum ratio clique problem
- Robust investment strategies with discrete asset choice constraints using DC programming
Cited In (7)
- Solving the index tracking problem: a continuous optimization approach
- 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
- 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)
