Publication detail
A Simulated Annealing Approach for Integer Maximal Multicommodity Flow Problem
ŠEDA, M.
English title
A Simulated Annealing Approach for Integer Maximal Multicommodity Flow Problem
Type
Paper in proceedings (conference paper)
Language
en
Original abstract
In this paper the Integer Maximal Multicommodity Flow Problem is discussed. It belongs to the class of NP-hard combinatorial problems and thus for large scale instances must be solved by approximation or heuristic techniques. Many techniques for solving these problems are based on various decomposition algorithms, cutting plane methods and Lagrangean relaxation usually used for integer programming problems. We propose quite a different approach based on simulated annealing where all evaluations of the objective function are provided by an allocation procedure.
Released
2004-09-01
Publisher
University of Zenica
Location
Neum (Bosnia and Herzegovina)
ISBN
9958-617-21-8
Book
Proceedings of the 8th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2004
Pages from–to
771–
Pages count
4
BIBTEX
@inproceedings{BUT12864,
author="Miloš {Šeda}",
title="A Simulated Annealing Approach for Integer Maximal Multicommodity Flow Problem",
booktitle="Proceedings of the 8th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2004",
year="2004",
pages="4",
publisher="University of Zenica",
address="Neum (Bosnia and Herzegovina)",
isbn="9958-617-21-8"
}