Marc Huber

Address:
Marc Huber
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room: HA0410
Phone: +43(1)58801–192144
Email: mhuber@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/mhuber/

 

 

Publications

7 results
2025
[7]Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding
, ,
Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 236-250, 2025, Springer.
[bibtex] [pdf] [doi]
2023
[6]A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem
,
Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 13789 of LNCS, pages 87-95, 2023, Springer.
[bibtex] [pdf] [doi]
[5]A Policy-Based Learning Beam Search for Combinatorial Optimization
, ,
Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 130–145, 2023, Springer.
Note: best paper award winner
[bibtex] [pdf] [doi]
2022
[4]A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems
,
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 22–23, 2022.
[bibtex] [pdf]
[3]A Learning Large Neighborhood Search for the Staff Rerostering Problem
, , ,
Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Pierre Schaus, ed.), volume 13292 of LNCS, pages 300–317, 2022, Springer.
[bibtex] [pdf] [doi]
[2]A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
, , ,
Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer.
Note: best paper award winner
[bibtex] [pdf] [doi]
[1]Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems
,
Machine Learning, Optimization, and Data Science, LOD 2021 (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Giorgio Jansen, Panos M. Pardalos, Giovanni Giuffrida, Renato Umeton, eds.), volume 13164 of LNCS, pages 283–298, 2022, Springer.
[bibtex] [pdf] [doi]

Technical Reports

Sorry, no results for this query