On the fixed charge transportation problem

Authors:
Kurt Spielberg
Affiliations:
-
Venue:
ACM '64 Proceedings of the 1964 19th ACM national conference
Year:
1964

Citing 1
Cited 2

Linear programming 1: introduction

Linear programming 1: introduction

The extended control language of MPSX/370 and possible applications

IBM Systems Journal
Minimizing Routing Energy Consumption: From Theoretical to Practical Results

GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper primarily investigates the application of mixed-variable techniques (due to J. F. Benders) to the Fixed Charge Transportation Problem. On account of the special structure of the problem several parts of the general algorithm can be simplified. The mathematical programming part of the general iteration becomes essentially a zero-one integer programming problem. The linear programming part reduces to a transportation problem with certain prohibited routes, which is discussed in detail. An example for the iterative procedure is given.