An extreme‐point tabu‐search algorithm for fixed‐charge network problems

DOI10.1002/net.22020OpenAlexW3122293043MaRDI QIDQ6087082

Fred Glover, Gary A. Kochenberger, Unnamed Author, Richard S. Barr

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22020

zbMATH Keywords

heuristicscombinatorial optimizationtabu searchnonconvex optimizationdiscrete optimizationnetwork optimizationmixed integer optimizationfixed-charge networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of location analysis
• The generalized alternating path algorithm for transportation problems
• Optimization by ghost image processes in neural networks
• A tabu search heuristic procedure for the fixed charge transportation problem
• COLE: a new heuristic approach for fixed charge problem computational results
• Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model
• Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
• Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup