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
Annealed replication: A new heuristic for the maximum clique problem, Lower bounds on paraclique density, \(f\)-flip strategies for unconstrained binary quadratic programming, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, Exploiting symmetries in mathematical programming via orbital independence, Computation of sparse and dense equilibrium strategies of evolutionary games, Finding maximum subgraphs with relatively large vertex connectivity, Algorithmic height compression of unordered trees, Detecting robust cliques in graphs subject to uncertain edge failures, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Reducing graph coloring to clique search, Tent and a subclass of \(P_{5}\)-free graphs, Two-phase heuristics for the \(k\)-club problem, A variable neighborhood search heuristic for the maximum ratio clique problem, Fixed interval scheduling: models, applications, computational complexity and algorithms, Infra-chromatic bound for exact maximum clique search, The worst-case time complexity for generating all maximal cliques and computational experiments, Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, New applications of clique separator decomposition for the maximum weight stable set problem, Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations, On finding \(k\)-cliques in \(k\)-partite graphs, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, On comparing algorithms for the maximum clique problem, Homothetic polygons and beyond: maximal cliques in intersection graphs, A characterization of Delsarte's linear programming bound as a ratio bound, The maximum independent union of cliques problem: complexity and exact approaches, The sociotechnical teams formation problem: a mathematical optimization approach, Unanimity and the Anscombe's paradox, Algorithms for the maximum \(k\)-club problem in graphs, Coloring the nodes of a directed graph, Unconstrained formulation of standard quadratic optimization problems, The unconstrained binary quadratic programming problem: a survey, An exact algorithm for the maximum probabilistic clique problem, Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms, Finding cliques of maximum weight on a generalization of permutation graphs, Standard bi-quadratic optimization problems and unconstrained polynomial reformulations, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, An exact approach for the vertex coloring problem, Clique-based facets for the precedence constrained knapsack problem, On the scalability of biocomputing algorithms: the case of the maximum clique problem, Combinatorial algorithms for the maximum \(k\)-plex problem, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, Risk transportation via a clique number problem formulation., Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs, Stability preserving transformations of graphs, Detecting anomaly collections using extreme feature ranks, Graph clustering, Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs, A sequential elimination algorithm for computing bounds on the clique number of a graph, A convex relaxation bound for subgraph isomorphism, Multi-threading a state-of-the-art maximum clique algorithm, A branch and cut solver for the maximum stable set problem, Dense subgraphs in random graphs, Quantum solutions for densest \(k\)-subgraph problems, Decomposing clique search problems into smaller instances based on node and edge colorings, A note on the problem of reporting maximal cliques, Fast local search for the maximum independent set problem, 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, Statistical analysis of financial networks, Finding quasi core with simulated stacked neural networks, Maximum regular induced subgraphs in \(2P_3\)-free graphs, On exact solution approaches for the longest induced path problem, Integer programming formulations for the minimum weighted maximal matching problem, A simpler characterization of a spectral lower bound on the clique number, Cliques with maximum/minimum edge neighborhood and neighborhood density, Measuring instance difficulty for combinatorial optimization problems, Upper bounds and heuristics for the 2-club problem, The combinatorics of pivoting for the maximum weight clique., Enumerating maximal independent sets with applications to graph colouring., Variable neighborhood search for the maximum clique, Improving an upper bound on the stability number of a graph, Potential energy principles in networked systems and their connections to optimization problems on graphs, Polyhedral properties of the induced cluster subgraphs, Coherent network partitions, Indirect unstructured hex-dominant mesh generation using tetrahedra recombination, Cover-encodings of fitness landscapes, Convex optimization for the densest subgraph and densest submatrix problems, 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, A network-based data mining approach to portfolio selection via weighted clique relaxations, A branch-and-bound approach for maximum quasi-cliques, Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers, 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, An effective local search for the maximum clique problem, Clique inference process for solving Max-CSP, An active-set algorithmic framework for non-convex optimization problems over the simplex, 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, Valid Inequalities and Separation Algorithms for the Set Partitioning Problem, On optimization problems in acyclic hypergraphs, 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
