Tabu search applied to the general fixed charge problem

DOI10.1007/BF02023003zbMath0775.90287WikidataQ57570802 ScholiaQ57570802MaRDI QIDQ2367015

Patrick G. McKeown, Minghe Sun

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Genetic algorithms and tabu search: Hybrids for optimization ⋮ Metaheuristics: A bibliography ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ Solving the uncapacitated facility location problem using tabu search ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ Determining buffer location and size in production lines using tabu search ⋮ A tabu search heuristic procedure for the fixed charge transportation problem ⋮ Hybrid extreme point tabu search

Cites Work

• Tabu search techniques. A tutorial and an application to neural networks
• Future paths for integer programming and links to artificial intelligence
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• A branch-and-bound algorithm for solving fixed charge problems
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• An Algorithm for Separable Nonconvex Programming Problems