The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
From MaRDI portal
Publication:5301139
DOI10.1287/opre.1120.1139zbMath1267.90125OpenAlexW2130919252MaRDI QIDQ5301139
Erick Moreno-Centeno, Richard M. Karp
Publication date: 2 July 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/de6e6a9adeb8e93810637e33127ab826c61f67ba
combinatorial optimizationheuristic algorithmsexact algorithmsmultigenome alignment problemmultisequence alignment problem
Related Items
The maximum feasible subset problem (maxFS) and applications, A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings, Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU, Computing generating sets of minimal size in finite algebras, Geometric hitting set for line-constrained disks, Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space, The Benders decomposition algorithm: a literature review, Boosting Answer Set Optimization with Weighted Comparator Networks, Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach, LMHS: A SAT-IP Hybrid MaxSAT Solver, The maximum weight trace alignment merging problem, Improved WPM encoding for coalition structure generation under MC-nets, Scalable algorithms for abduction via enumerative syntax-guided synthesis
