The maximum ratio clique problem

@article{Sethuraman2015TheMR,
  title={The maximum ratio clique problem},
  author={S. Sethuraman and S. Butenko},
  journal={Computational Management Science},
  year={2015},
  volume={12},
  pages={197-218}
}
This paper introduces a fractional version of the classical maximum weight clique problem, the maximum ratio clique problem, which is to find a maximal clique that has the largest ratio of benefit and cost weights associated with the clique’s vertices. NP-completeness of the decision version of the problem is established, and three solution methods are proposed. The results of numerical experiments with standard graph instances, as well as with real-life instances arising in finance and energy… Expand
The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results
  • M. Moeini
  • Mathematics, Computer Science
  • MCO
  • 2015
TLDR
An efficient approach based on Difference of Convex functions (DC) programming and DC Algorithm (DCA) for solving MRCP is looked for and the introduction of the valid inequalities improves the computational time of the classical approaches. Expand
A Variable Neighborhood Search heuristic for the maximum ratio clique problem
TLDR
The first heuristic approach to solve the maximum ratio clique problem (MRCP) is presented, i.e., a multi-start Variable Neighborhood Search (MS-VNS) algorithm that outperforms the classical methods used for solving MRCP. Expand
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
TLDR
A branch-and-bound algorithm for solving the general version of the classical minimum spanning tree problem based on its image space representation and specifically addresses the difficulties arising in the case when the number of ratios exceeds two. Expand
On Maximum Weight Clique Algorithms, and How They Are Evaluated
TLDR
This work looks at other families of benchmark instances for the maximum weight clique problem, coming from winner determination problems, graph colouring, and error-correcting codes, and introduces two new families of instances, based upon kidney exchange and the Research Excellence Framework, which carry much more interesting structure. Expand
Fractional 0-1 programming and submodularity
TLDR
This work provides a complete characterization of the conditions, which ensure that a single-ratio function is submodular, and illustrates the theoretical results with the assortment optimization and facility location problems, and discusses practical situations that guarantee submodularity in the considered application settings. Expand
An Exact Method for Assortment Optimization under the Nested Logit Model
We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known toExpand
An Exact Method for Assortment Optimization Under the Nested Logit Model
TLDR
It is shown that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which means that the approach can solve the most general problem setting. Expand
Clique Relaxations in Biological and Social Network Analysis Foundations and Algorithms
Abstract : The objective of this project is to provide a unifying theoretical and computational framework for the study of clique relaxation models arising in biological and social networks. ThisExpand
Fractional 0–1 programming: applications and algorithms
TLDR
This survey overviews the literature on fractional 0–1 programs including their applications, related computational complexity issues and solution methods including exact, approximation and heuristic algorithms. Expand
On Robust Fractional 0-1 Programming
TLDR
This work considers RFPs under a wide range of disjoint and joint uncertainty sets, where the uncertainty sets are distributed over a large number of discrete-time programming problems. Expand
...
1
2
...

References

SHOWING 1-10 OF 30 REFERENCES
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
TLDR
A branch-and-bound algorithm for solving the general version of the classical minimum spanning tree problem based on its image space representation and specifically addresses the difficulties arising in the case when the number of ratios exceeds two. Expand
The maximum clique problem
TLDR
A survey of results concerning algorithms, complexity, and applications of the maximum clique problem is presented and enumerative and exact algorithms, heuristics, and a variety of other proposed methods are discussed. Expand
The Complexity of Minimum Ratio Spanning Tree Problems
We examine the complexity of two minimum spanning tree problems with rational objective functions. We show that the Minimum Ratio Spanning Tree problem is NP-hard when the denominator is unrestrictedExpand
Minimal ratio spanning trees
TLDR
It is shown that an algorithm that is “greedy,” in the sense of Edmonds [2], will not work for this problem and an extension to finding bases in matroids that minimize such ratio functions is immediate. Expand
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
A network flow technique is used to solve the unconstrained nonlinear 0-1 programming problem, which is maximizing the ratio of two polynomials, assuming that all the nonlinear coefficients in theExpand
Letter to the Editor - Finding Minimal Cost-Time Ratio Circuits
  • B. Fox
  • Mathematics, Computer Science
  • Oper. Res.
  • 1969
TLDR
This note presents an efficient method for the solution of the flow-circulation problem, the basis for which is a search for a way to route flow so that the cost-time trade-off is optimal. Expand
Handbook of Combinatorial Optimization
Preface - Data Correcting Algorithms in Combinatorial Optimization - The Steiner Ratio of Banach-Minkowski Space - Probabilistic Verification and Non-Approximability - Steiner Trees in Industry -Expand
New scaling algorithms for the assignment and minimum mean cycle problems
TLDR
The assignment algorithm is based on applying scaling to a hybrid version of the recent auction algorithm of Bertsekas and the successive shortest path algorithm and can be solved in O( $$\sqrt n $$ m lognC) time, which is the best available time bound to solve the minimum mean cycle problem. Expand
Complexity results for well-covered graphs
TLDR
It is shown that well-covered graph recognition is co-NP-complete and that several other problems are NP-complete for well- covered graphs. Expand
Newton's method for fractional combinatorial optimization
  • T. Radzik
  • Mathematics, Computer Science
  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
TLDR
The authors considers Newton's method for the linear fractional combinatorial optimization and proves a strongly polynomial bound on the number of iterations for the general case and the maximum mean-weight cut problem, which is closely related to the parametric flow problem and the flow problem when the maximum arc cost is being minimised. Expand
...
1
2
3
...