scientific article; zbMATH DE number 6118217
From MaRDI portal
Publication:3145799
Cited in
(only showing first 100 items - show all)- Approximating the maximum vertex/edge weighted clique using local search
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- The equitable dispersion problem
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- An effective local search for the maximum clique problem
- Clique inference process for solving Max-CSP
- Risk transportation via a clique number problem formulation.
- Convex optimization for the densest subgraph and densest submatrix problems
- Annealed replication: A new heuristic for the maximum clique problem
- Computation of sparse and dense equilibrium strategies of evolutionary games
- Detecting robust cliques in graphs subject to uncertain edge failures
- A variable neighborhood search heuristic for the maximum ratio clique problem
- On comparing algorithms for the maximum clique problem
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Detecting anomaly collections using extreme feature ranks
- Multi-threading a state-of-the-art maximum clique algorithm
- Dense subgraphs in random graphs
- Decomposing clique search problems into smaller instances based on node and edge colorings
- Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem
- General cut-generating procedures for the stable set polytope
- On the representation number of a crown graph
- Integer programming formulations for the minimum weighted maximal matching problem
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- Measuring instance difficulty for combinatorial optimization problems
- Cover-encodings of fitness landscapes
- Unconstrained formulation of standard quadratic optimization problems
- Finding cliques of maximum weight on a generalization of permutation graphs
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Quantum solutions for densest \(k\)-subgraph problems
- On exact solution approaches for the longest induced path problem
- Potential energy principles in networked systems and their connections to optimization problems on graphs
- Polyhedral properties of the induced cluster subgraphs
- Coherent network partitions
- Strengthened clique-family inequalities for the stable set polytope
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- A clique search problem and its application to machine scheduling
- Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
- Worst-case analysis of clique MIPs
- On recognizing staircase compatibility
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
- Continuous cubic formulations for cluster detection problems in networks
- Numerical experiments with LP formulations of the maximum clique problem
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances
- The maximum independent union of cliques problem: complexity and exact approaches
- The sociotechnical teams formation problem: a mathematical optimization approach
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
- Estimating the fractional chromatic number of a graph
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- Graph signatures: identification and optimization
- Coherent network partitions: characterizations with cographs and prime graphs
- Speeding up branch and bound algorithms for solving the maximum clique problem
- Rounding on the standard simplex: regular grids for global optimization
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- Metastability in stochastic replicator dynamics
- QPLIB: a library of quadratic programming instances
- Estimating clique size by coloring the nodes of auxiliary graphs
- On the maximum small-world subgraph problem
- A new lifting theorem for vertex packing
- Optimization problems involving group sparsity terms
- Word-representability of Toeplitz graphs
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- An integer programming approach for finding the most and the least central cliques
- Coloring the edges of a directed graph
- The maximum ratio clique problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- On characterization of maximal independent sets via quadratic optimization
- New lower bounds for the Shannon capacity of odd cycles
- Phased local search for the maximum clique problem
- Building an iterative heuristic solver for a quantum annealer
- On a continuous approach for the maximum weighted clique problem
- Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation
- Generating binary partial Hadamard matrices
- Reducing hypergraph coloring to clique search
- A new trust region technique for the maximum weight clique problem
- Computational study of the US stock market evolution: a rank correlation-based network model
- Maximum common induced subgraph parameterized by vertex cover
- Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
- Using critical sets to solve the maximum independent set problem
- Exploiting semidefinite relaxations in constraint programming
- A hybrid heuristic for the maximum clique problem
- A study of ACO capabilities for solving the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- Mining market data: a network approach
- A constraint programming approach to extract the maximum number of non-overlapping test forms
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- Novel approaches for analyzing biological networks
- Quartic formulation of standard quadratic optimization problems
- Edge coloring of graphs, uses, limitation, complexity
- Using SVM to combine global heuristics for the standard quadratic problem
- A review on algorithms for maximum clique problems
- Finding disjoint dense clubs in a social network
- Copositivity cuts for improving SDP bounds on the clique number
- Extended and discretized formulations for the maximum clique problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145799)
