Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem

DOI10.1057/jors.1996.143zbMath0869.90073OpenAlexW2014039408MaRDI QIDQ5285355

Cüneyt F. Bazlamaçci, Khalil S. Hindi

Publication date: 31 March 1997

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1996.143

zbMATH Keywords

heuristicstabu searchadjacent extreme point searchconcave-cost, uncapacitated transshipment networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope

This page was built for publication: Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem