The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results
From MaRDI portal
Publication:5356986
DOI10.1007/978-3-319-18161-5_19zbMath1370.90197OpenAlexW791074792MaRDI QIDQ5356986
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
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Boolean programming (90C09) Portfolio theory (91G10)
Related Items
A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Solving the index tracking problem: a continuous optimization approach ⋮ On maximum ratio clique relaxations
Cites Work
- Unnamed Item
- Unnamed Item
- Exact penalty and error bounds in DC programming
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- DC programming and DCA for globally solving the value-at-risk
- A note on a global approach for general 0-1 fractional programming
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
- The maximum ratio clique problem
- Mining market data: a network approach
- A continuous approch for globally solving linearly constrained quadratic
- Robust investment strategies with discrete asset choice constraints using DC programming
- DC programming approach for portfolio optimization under step increasing transaction costs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Parametric approaches to fractional programs
- A Novel Efficient Approach for Solving the Art Gallery Problem
