Carsp

Parallel Variable Neighborhood Search for the Car Sequencing Problem
October 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Prandtstetter
PDF Cite
An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem
European Journal of Operational Research, volume 191, number 3, pages 1004-1022, 2008.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf
PDF Cite
Exact and Heuristic Methods for Solving the Car Sequencing Problem
August 2005, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu
PDF Cite
A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
PDF Cite
An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem
2005, Technical report TR 186-1-05-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF Cite