An analytical comparison of the LP relaxations of integer models for the k-club problem-Reference-Cited by-同舟云学术

An analytical comparison of the LP relaxations of integer models for the k-club problem

Published:2014-02 Issue:3 Volume:232 Page:489-498
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Almeida Maria Teresa,Carvalho Filipa D.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference21 articles.

1. A graph-theoretic definition of a sociometric clique;Alba;Journal of Mathematical Sociology,1973

2. Solving the maximum weight clique problem via unconstrained quadratic programming;Alidaee;European Journal of Operational Research,2007

3. Integer models and upper bounds for the 3-club problem;Almeida;Networks,2012

4. Projection, lifting and extended formulation in integer and combinatorial optimization;Balas;Annals of Operations Research,2005

5. Novel approaches for analyzing biological networks;Balasundaram;Journal of Combinatorial Optimization,2005

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Fault-Tolerant Low-Diameter Clusters in Graphs;INFORMS Journal on Computing;2022-11

2. An effective branch-and-bound algorithm for the maximum s-bundle problem;European Journal of Operational Research;2022-02

3. On the maximum small-world subgraph problem;European Journal of Operational Research;2020-02

4. Parsimonious formulations for low-diameter clusters;Mathematical Programming Computation;2020-01-30

5. Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments;European Journal of Operational Research;2019-06