A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
From MaRDI portal
Publication:1389247
DOI10.1023/A:1009630528341zbMath0903.90120MaRDI QIDQ1389247
Publication date: 1998
Published in: Journal of Heuristics (Search for Journal in Brave)
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)
Related Items
The transportation problem with conflicts, Branch-and-cut for linear programs with overlapping SOS1 constraints, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, Minimum cost noncrossing flow problem on layered networks, Minimum cost flow problem with conflicts, Maximum weight perfect matching problem with additional disjunctive conflict constraints, Maximum weighted matching with few edge crossings for 2-layered bipartite graph, Solving the uncapacitated facility location problem using tabu search, Assignment problem with conflicts, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, Determining buffer location and size in production lines using tabu search, Hybrid extreme point tabu search
