Detail publikace

A Simulated Annealing Approach for Integer Maximal Multicommodity Flow Problem

ŠEDA, M.

Anglický název

A Simulated Annealing Approach for Integer Maximal Multicommodity Flow Problem

Typ

Stať ve sborníku v databázi WoS či Scopus

Jazyk

en

Originální abstrakt

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.

Vydáno

2004-09-01

Nakladatel

University of Zenica

Místo

Neum (Bosnia and Herzegovina)

ISBN

9958-617-21-8

Kniha

Proceedings of the 8th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2004

Strany od–do

771–

Počet stran

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"
}