scientific article
From MaRDI portal
Publication:3145799
zbMath1253.90188MaRDI QIDQ3145799
Immanuel M. Bomze, Marco Budinich, Marcello Pelillo, Panos M. Pardalos
Publication date: 23 December 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Subgraph extraction and metaheuristics for the maximum clique problem ⋮ On characterization of maximal independent sets via quadratic optimization ⋮ Optimal monotone relabelling of partially non-monotone ordinal data ⋮ New lower bounds for the Shannon capacity of odd cycles ⋮ Phased local search for the maximum clique problem ⋮ Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Edge coloring of graphs, uses, limitation, complexity ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ 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 ⋮ Fast Cluster Detection in Networks by First Order Optimization ⋮ Orbital Independence in Symmetric Mathematical Programs ⋮ Word-Representable Graphs: a Survey ⋮ 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 ⋮ Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ Extended and discretized formulations for the maximum clique problem ⋮ Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation ⋮ QUBO formulations of the longest path problem ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ Generating irreducible copositive matrices using the stable set problem ⋮ The stable set problem: clique and nodal inequalities revisited ⋮ Solving longest common subsequence problems via a transformation to the maximum clique problem ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights ⋮ Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques ⋮ On atomic cliques in temporal graphs ⋮ Partial Lasserre relaxation for sparse Max-Cut ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Which networks permit stable allocations? A theory of network‐based comparisons ⋮ Generating binary partial Hadamard matrices ⋮ On maximum ratio clique relaxations ⋮ Reducing hypergraph coloring to clique search ⋮ The clique problem with multiple-choice constraints under a cycle-free dependency graph ⋮ On the 2-Club Polytope of Graphs ⋮ A General Regularized Continuous Formulation for the Maximum Clique Problem ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study ⋮ A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft ⋮ A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems ⋮ A new trust region technique for the maximum weight clique problem ⋮ On the Approximability of the Minimum Weight $t$-partite Clique Problem ⋮ Computational study of the US stock market evolution: a rank correlation-based network model ⋮ Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications ⋮ Maximum common induced subgraph parameterized by vertex cover ⋮ Finding large cliques in sparse semi-random graphs by simple randomized search heuristics ⋮ Subgroup growth of right‐angled Artin and Coxeter groups ⋮ A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique ⋮ Finding Disjoint Dense Clubs in an Undirected Graph ⋮ Using critical sets to solve the maximum independent set problem ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Equilibrium Distributions of Populations of Biological Species on Networks of Social Sites ⋮ Parallelization of a branch-and-bound algorithm for the maximum weight clique problem ⋮ Estimating the fractional chromatic number of a graph ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ 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 ⋮ 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 ⋮ A strengthened formulation and cutting planes for the open pit mine production scheduling problem ⋮ Mining market data: a network approach ⋮ A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming ⋮ Metastability in stochastic replicator dynamics ⋮ 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 ⋮ QPLIB: a library of quadratic programming instances ⋮ Algorithms for finding maximum transitive subtournaments ⋮ A characterization of the weighted Lovász number based on convex quadratic programming ⋮ On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes ⋮ An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique ⋮ Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection ⋮ 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 ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs ⋮ Word-representability of Toeplitz graphs ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem ⋮ Novel approaches for analyzing biological networks ⋮ Quartic formulation of standard quadratic optimization problems ⋮ An integer programming approach for finding the most and the least central cliques ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem ⋮ Coloring the edges of a directed graph ⋮ The maximum ratio clique problem ⋮ Annealed replication: A new heuristic for the maximum clique problem
This page was built for publication:
