Tabu search applied to the general fixed charge problem
type: Item
instance of: scholarly article
title: Tabu search applied to the general fixed charge problem
zbMATH Open document ID: 0775.90287
DOI: 10.1007/BF02023003
author: Minghe Sun
author: Patrick G. McKeown
published in: Annals of Operations Research
publication date: 1993-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 232551
MaRDI profile type: Publication
Wikidata QID: Q57570802
cites work: Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Future paths for integer programming and links to artificial intelligence
cites work: A branch-and-bound algorithm for solving fixed charge problems
cites work: A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
description: scientific article