The following pages link to (Q3145799):
Displaying 50 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Lower bounds on paraclique density (Q266841) (← links)
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Algorithmic height compression of unordered trees (Q304776) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Reducing graph coloring to clique search (Q326946) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- On finding \(k\)-cliques in \(k\)-partite graphs (Q360493) (← links)
- Unanimity and the Anscombe's paradox (Q384521) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations (Q427394) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Graph clustering (Q458448) (← links)
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- Finding quasi core with simulated stacked neural networks (Q526647) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- The combinatorics of pivoting for the maximum weight clique. (Q703275) (← links)
- Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
- A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
