Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem
From MaRDI portal
Publication:5285355
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
Cited in
(4)- 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
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- 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)
