Discrete and Combinatorial Optimization I

Discrete and Combinatorial Optimization I

Session Chair: To be assigned

Session Chair: To be assigned

06/07, 11:15 - 13:15, Room 10A

06/07, 11:15 - 13:15, Room 10A

• Improving local search in a minimum vertex cover solver for classes of networks. Markus Wagner, Tobias Friedrich and Marius Lindauer
• An Adaptive Large Neighborhood Search with Learning Automata for the Unrelated Parallel Machine Scheduling Problem. Luciano Perdigao Cota, Frederico Guimaraes, Fernando de Oliveira and Marcone Jamilson Freitas Souza
• On Asymptotic Complexity of the Optimum Golomb Ruler Problem: From Established Stochastic Methods to Self-Avoiding Walks. Franc Brglez, Borko Boskovic and Janez Brest
• Applying the Biased Form of the Adaptive Generative Representation. James Montgomery and Daniel Ashlock
• A Square Lattice Probability Model for Optimising the Graph Partitioning Problem. Josu Ceberio, Alexander Mendiburu and Jose Antonio Lozano
• On the Evolution of Bent (n, m) Functions. Stjepan Picek, Karlo Knezevic and Domagoj Jakobovic