This article introduces and studies two clique relaxation models with fractional objectives: the maximum ratio s$$ s $$‐plex problem and the maximum ratio s$$ s $$‐defective clique problem. The decision version of each problem is shown to be strongly NP$$ NP $$‐complete; we also discuss some related computational complexity issues. The base optimization models are single‐ratio fractional 0‐1 problems. We describe two general types of solution methods: the first one is based on mixed‐integer linear programs (MILPs) obtained by linearizing the original nonlinear 0‐1 models; the other one exploits parametric methods (namely, a binary search and Newton's method) that solve MILPs in an iterative manner. For the proposed MILPs, we derive valid inequalities that are shown to substantially improve the performance of an off‐the‐shelf MILP solver. Finally, the considered solution approaches are compared via extensive numerical experiments using a set of artificially generated and real‐life network instances.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.