The following pages link to Matthias Horn (Q1026619):
Displayed 7 items.
- An ``age''-structured model of hematopoietic stem cell organization with application to chronic myeloid leukemia (Q1026620) (← links)
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156) (← links)
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017) (← links)
- Optimal algorithms for global optimization in case of unknown Lipschitz constant (Q2489149) (← links)
- On the use of decision diagrams for finding repetition-free longest common subsequences (Q2679779) (← links)