The maximum ratio clique problem
From MaRDI portal
Publication:2356159
DOI10.1007/s10287-013-0197-zzbMath1327.90246OpenAlexW2124329048WikidataQ56210437 ScholiaQ56210437MaRDI QIDQ2356159
Samyukta Sethuraman, Sergiy I. Butenko
Publication date: 29 July 2015
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-013-0197-z
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Combinatorial optimization (90C27)
Related Items
A variable neighborhood search heuristic for the maximum ratio clique problem, Fractional 0-1 programming and submodularity, Fractional 0-1 programming: applications and algorithms, On atomic cliques in temporal graphs, On maximum ratio clique relaxations, The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results, An exact method for assortment optimization under the nested logit model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact solution of a class of nonlinear knapsack problems
- New scaling algorithms for the assignment and minimum mean cycle problems
- A characterization of the minimum cycle mean in a digraph
- A note on a global approach for general 0-1 fractional programming
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Global optimization of 0-1 hyperbolic programs
- An algorithm for fractional assignment problems
- Approximation algorithms for fractional knapsack problems
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Mining market data: a network approach
- The complexity of minimum ratio spanning tree problems
- Combinatorial Optimization with Rational Objective Functions
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Complexity results for well‐covered graphs
- Minimal ratio spanning trees
- Parametric approaches to fractional programs
- On Nonlinear Fractional Programming
