scientific article

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.

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (only showing first 100 items - show all)

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

This page was built for publication: