Christian Blum | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/christian-blum/Christian BlumHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngChristian Blumhttps://ac.tuwien.ac.at/team/christian-blum/A Hybrid CMSA–Column Generation Approach to Variable-Sized Bin Packinghttps://ac.tuwien.ac.at/publication/a-hybrid-cmsa-column-generation-approach-to-variable-sized-bin-packing/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-cmsa-column-generation-approach-to-variable-sized-bin-packing/Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Findinghttps://ac.tuwien.ac.at/publication/learning-to-select-promising-initial-solutions-for-large-neighborhood-search-based-multi-agent-path-finding/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-to-select-promising-initial-solutions-for-large-neighborhood-search-based-multi-agent-path-finding/A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-for-solving-the-longest-common-square-subsequence-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-for-solving-the-longest-common-square-subsequence-problem/A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-neural-network-based-guidance-for-a-brkga-an-application-to-the-longest-common-square-subsequence-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-neural-network-based-guidance-for-a-brkga-an-application-to-the-longest-common-square-subsequence-problem/Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequenceshttps://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Stringshttps://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Stringshttps://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Stringshttps://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculationhttps://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/An A* Search Algorithm for the Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/An A* Search Algorithm for the Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/Anytime Algorithms for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/Finding Longest Common Subsequences: New anytime A$^*$ Search Resultshttps://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/On Solving a Generalized Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequenceshttps://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problemhttps://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem-2/Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problemhttps://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problemhttps://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/A Heuristic Approach for Solving the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/A Heuristic Approach for Solving the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/Finding Longest Common Subsequences: New A* Anytime Resultshttps://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithmhttps://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Anytime Algorithms for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatmenthttps://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/Large Neighborhood Search for the Most Strings with Few Bad Columns Problemhttps://ac.tuwien.ac.at/publication/large-neighborhood-search-for-the-most-strings-with-few-bad-columns-problem/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-the-most-strings-with-few-bad-columns-problem/Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problemhttps://ac.tuwien.ac.at/publication/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem/Hybrid Metaheuristics – Powerful Tools for Optimizationhttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristicshttps://ac.tuwien.ac.at/publication/on-solving-the-most-strings-with-few-bad-columns-problem-an-ilp-model-and-heuristics/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-the-most-strings-with-few-bad-columns-problem-an-ilp-model-and-heuristics/Hybrid Metaheuristics in Combinatorial Optimization: A Surveyhttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/A Brief Survey on Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics/