A tabu search heuristic procedure for the fixed charge transportation problem
type: Item
instance of: scholarly article
title: A tabu search heuristic procedure for the fixed charge transportation problem
zbMATH Open document ID: 0991.90010
DOI: 10.1016/S0377-2217(97)00284-1
author: Minghe Sun
author: Jay E. Aronson
author: Patrick G. McKeown
author: Dennis Drinka
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1782818
zbMATH Keywords: networks/graphs
zbMATH Keywords: flow algorithms
zbMATH Keywords: programming
zbMATH Keywords: integer algorithms
zbMATH Keywords: integer heuristic
zbMATH Keywords: fixed charge transportation problem
zbMATH Keywords: tabu search
Wikidata QID: Q57570788
describes a project that uses: Tabu search
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: A survey of dynamic network flows
cites work: Fixed-cost transportation problems
cites work: A New Optimization Method for Large Scale Fixed Charge Transportation Problems
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: Some branch-and-bound procedures for fixed-cost transportation problems
cites work: Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
cites work: The fixed charge problem. I: A new heuristic method
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: The pure fixed charge transportation problem
cites work: Q4377046
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4354785
cites work: A user's guide to tabu search
cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
cites work: The fixed charge problem
cites work: Q3968758
cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: An approximative algorithm for the fixed-charges transportation problem
cites work: On the fixed cost flow problem†
cites work: Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
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: An easy solution for a special class of fixed charge problems
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: A Branch-and-Bound Method for the Fixed Charge Transportation Problem
cites work: Use of penalties in a branch and bound procedure for the fixed charge transportation problem
cites work: Q3478275
cites work: Tabu search applied to the general fixed charge problem
cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
cites work: Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
cites work: COAL: A new heuristic approach for solving the fixed charge problem - computational results
cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging
cites work: Minimum Concave Cost Flows in Certain Networks
cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
full work available at URL: s0377-2217(97)00284-1
OpenAlex ID: W1970848641
description: scientific article; zbMATH DE number 1782818