The following pages link to (Q3145799):
Displaying 50 items.
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) (← links)
- Estimating the fractional chromatic number of a graph (Q2236364) (← links)
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem (Q2270449) (← links)
- Metastability in stochastic replicator dynamics (Q2280198) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- Optimization problems involving group sparsity terms (Q2330642) (← links)
- Word-representability of Toeplitz graphs (Q2334044) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- New lower bounds for the Shannon capacity of odd cycles (Q2364621) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- On a continuous approach for the maximum weighted clique problem (Q2392119) (← links)
- Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule (Q2392761) (← links)
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
- Generating binary partial Hadamard matrices (Q2420401) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- Computational study of the US stock market evolution: a rank correlation-based network model (Q2438061) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (Q2455599) (← links)
- Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- A hybrid heuristic for the maximum clique problem (Q2491328) (← links)
- A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- Mining market data: a network approach (Q2499151) (← links)
- A constraint programming approach to extract the maximum number of non-overlapping test forms (Q2506175) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Novel approaches for analyzing biological networks (Q2576439) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- Edge coloring of graphs, uses, limitation, complexity (Q2629566) (← links)
- Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
