Tabu search applied to the general fixed charge problem

DOI10.1007/BF02023003MaRDI QIDQ2367015zbMATH OpenWikidataFDO

Authors Minghe Sun, Patrick G. McKeown

Publication date 16 August 1993

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

Full work available at URL https://doi.org/10.1007/BF02023003

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(8)

• Genetic algorithms and tabu search: Hybrids for optimization
• 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
• Metaheuristics: A bibliography
• Solving the uncapacitated facility location problem using tabu search
• COLE: a new heuristic approach for fixed charge problem computational results
• Minimal-cost network flow problems with variable lower bounds on arc flows

This page was built for publication: Tabu search applied to the general fixed charge problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367015)