Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem
From MaRDI portal
Publication:5285355
DOI10.1057/JORS.1996.143zbMATH Open0869.90073OpenAlexW2014039408MaRDI QIDQ5285355FDOQ5285355
Authors: Cüneyt F. Bazlamaçci, Khalil S. Hindi 
Publication date: 31 March 1997
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1996.143
Recommendations
- An adaptive tabu-simulated annealing for concave cost transportation problems
- Exact solution methods for uncapacitated location problems with convex transportation costs
- Global and local search algorithms for concave cost transshipment problems
- scientific article; zbMATH DE number 64776
- Tabu search and lower bounds for a combined production-transportation problem
- A tabu search approach to the uncapacitated facility location problem
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- A solver for the multi-objective transshipment problem with facility location
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
- scientific article; zbMATH DE number 2209653
heuristicstabu searchadjacent extreme point searchconcave-cost, uncapacitated transshipment networks
Cited In (4)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- An adaptive tabu-simulated annealing for concave cost transportation problems
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- Global and local search algorithms for concave cost transshipment problems
This page was built for publication: Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285355)
