The following pages link to (Q3145799):
Displaying 50 items.
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- A note on the problem of reporting maximal cliques (Q955035) (← links)
- Statistical analysis of financial networks (Q957122) (← links)
- A simpler characterization of a spectral lower bound on the clique number (Q966428) (← links)
- Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers (Q1015327) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- Clique inference process for solving Max-CSP (Q1042201) (← links)
- Risk transportation via a clique number problem formulation. (Q1412758) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- Computation of sparse and dense equilibrium strategies of evolutionary games (Q1630457) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Detecting anomaly collections using extreme feature ranks (Q1715864) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Dense subgraphs in random graphs (Q1741497) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (Q1752252) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- On the representation number of a crown graph (Q1752592) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Cover-encodings of fitness landscapes (Q1786928) (← links)
- Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← links)
- Finding cliques of maximum weight on a generalization of permutation graphs (Q1940437) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Coherent network partitions (Q2026346) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse (Q2070338) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- On recognizing staircase compatibility (Q2093277) (← links)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- The sociotechnical teams formation problem: a mathematical optimization approach (Q2178344) (← links)
