Pages that link to "Item:Q5301139"

The following pages link to The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment (Q5301139):

Displaying 12 items.

• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• The maximum weight trace alignment merging problem (Q2062010) (← links)
• Scalable algorithms for abduction via enumerative syntax-guided synthesis (Q2096443) (← links)
• A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings (Q2184062) (← links)
• Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
• Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach (Q2302940) (← links)
• Improved WPM encoding for coalition structure generation under MC-nets (Q2331103) (← links)
• LMHS: A SAT-IP Hybrid MaxSAT Solver (Q2818041) (← links)
• Boosting Answer Set Optimization with Weighted Comparator Networks (Q4957202) (← links)
• The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
• Computing generating sets of minimal size in finite algebras (Q6108373) (← links)