The maximum ratio clique problem

DOI10.1007/S10287-013-0197-ZMaRDI QIDQ2356159zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Samyukta Sethuraman, Sergiy 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

zbMATH Keywords

maximum cliquesocial network analysisfractional combinatorial optimizationmarket graph

Mathematics Subject Classification ID

Fractional programming (90C32) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Recommendations

• The maximum ratio clique problem: A continuous optimization approach and some new results
• A variable neighborhood search heuristic for the maximum ratio clique problem
• A new algorithm for the maximum-weight clique problem
• The maximum clique problem
• On the maximum quasi-clique problem

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256704 (Why is no real title available?)
• scientific article; zbMATH DE number 1302174 (Why is no real title available?)
• scientific article; zbMATH DE number 2190133 (Why is no real title available?)
• scientific article; zbMATH DE number 3302125 (Why is no real title available?)
• scientific article; zbMATH DE number 3197631 (Why is no real title available?)
• A characterization of the minimum cycle mean in a digraph
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• A note on a global approach for general 0-1 fractional programming
• An algorithm for fractional assignment problems
• Approximation algorithms for fractional knapsack problems
• Combinatorial Optimization with Rational Objective Functions
• Complexity results for well‐covered graphs
• Exact solution of a class of nonlinear knapsack problems
• Global optimization of 0-1 hyperbolic programs
• Minimal ratio spanning trees
• Mining market data: a network approach
• New scaling algorithms for the assignment and minimum mean cycle problems
• On Nonlinear Fractional Programming
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Parametric approaches to fractional programs
• The complexity of minimum ratio spanning tree problems

Cited in

(8)

• Fractional 0-1 programming: applications and algorithms
• On atomic cliques in temporal graphs
• A variable neighborhood search heuristic for the maximum ratio clique problem
• The maximum ratio clique problem: A continuous optimization approach and some new results
• Fractional 0-1 programming and submodularity
• On maximum ratio clique relaxations
• An exact method for assortment optimization under the nested logit model
• An implicit enumeration approach for maximum ratio clique relaxations

This page was built for publication: The maximum ratio clique problem

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