Marc Huber | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/marc-huber/Marc HuberHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngMarc Huberhttps://ac.tuwien.ac.at/team/marc-huber/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 Policy-Based Learning Beam Search for Combinatorial Optimizationhttps://ac.tuwien.ac.at/publication/a-policy-based-learning-beam-search-for-combinatorial-optimization/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-policy-based-learning-beam-search-for-combinatorial-optimization/A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-the-longest-common-subsequence-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-the-longest-common-subsequence-problem/A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculationhttps://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculationhttps://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/A Learning Large Neighborhood Search for the Staff Rerostering Problemhttps://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problemshttps://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-longest-common-subsequence-problems/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-longest-common-subsequence-problems/Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problemshttps://ac.tuwien.ac.at/publication/learning-beam-search-utilizing-machine-learning-to-guide-beam-search-for-solving-combinatorial-optimization-problems/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-beam-search-utilizing-machine-learning-to-guide-beam-search-for-solving-combinatorial-optimization-problems/