On maximum ratio clique relaxations
From MaRDI portal
Publication:6085884
DOI10.1002/net.22097OpenAlexW4224061155MaRDI QIDQ6085884
Oleg A. Prokopyev, Unnamed Author, Sergiy I. Butenko, Petar Momčilović
Publication date: 12 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22097
networkparametric methodslinearizationmixed integer programmingclique relaxationfractional 0-1 programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- New scaling algorithms for the assignment and minimum mean cycle problems
- A note on a global approach for general 0-1 fractional programming
- The maximum clique problem
- A variable neighborhood search heuristic for the maximum ratio clique problem
- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- On the maximum quasi-clique problem
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Global optimization of 0-1 hyperbolic programs
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- On clique relaxation models in network analysis
- The maximum ratio clique problem
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Linear forms of nonlinear expressions: new insights on old ideas
- Clique-detection models in computational biochemistry and genomics
- A polyhedral study of the generalized vertex packing problem
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- A review on algorithms for maximum clique problems
- Linear degree extractors and the inapproximability of max clique and chromatic number
- A eighth bibliography of fractional programming
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Complexity results for well‐covered graphs
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- Networks
- Integer programming models for detecting graph bipartitions with structural requirements
- Parametric approaches to fractional programs
- The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results
- Node-and edge-deletion NP-complete problems
- On Nonlinear Fractional Programming
