Pages that link to "Item:Q5322098"
From MaRDI portal
The following pages link to Optimal Protein Structure Alignment Using Maximum Cliques (Q5322098):
Displaying 23 items.
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- A heuristic for the time constrained asymmetric linear sum assignment problem (Q511701) (← links)
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach (Q3386793) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- MODELING AND OPTIMIZATION OF GENETIC SCREENS VIA RNA INTERFERENCE AND FACS (Q5358030) (← links)
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (Q5387638) (← links)
- Some operations research methods for analyzing protein sequences and structures (Q5900888) (← links)
- On solving simplified diversified top-\(k\,s\)-plex problem (Q6164387) (← links)
