Marc Huber

According to our database, Marc Huber authored at least 5 papers between 2021 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

A Policy-Based Learning Beam Search for Combinatorial Optimization.

Rupert Ettrich, Marc Huber, Günther R. Raidl

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023

2022

A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation.

Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2022

A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem.

Marc Huber, Günther R. Raidl

Proceedings of the Computer Aided Systems Theory - EUROCAST 2022, 2022

A Learning Large Neighborhood Search for the Staff Rerostering Problem.

Fabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021

Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems.

Marc Huber, Günther R. Raidl

Proceedings of the Machine Learning, Optimization, and Data Science, 2021