The practical conversion of linear programmes to network flow models
type: Item
instance of: scholarly article
title: The practical conversion of linear programmes to network flow models
zbMATH Open document ID: 0722.90045
DOI: 10.1016/0377-2217(91)90264-V
author: D. Kharzeev
published in: European Journal of Operational Research
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 4191394
zbMATH Keywords: equivalent problem transformation
zbMATH Keywords: minimum cost network flow models
zbMATH Keywords: spanning tree
MaRDI profile type: Publication
cites work: A good submatrix is hard to find
cites work: Q3726127
cites work: Converting Linear Programs to Network Problems
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
cites work: A Control Problem of Bellman
cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
cites work: Determining GUB sets via an invert agenda algorithm
cites work: Identification of special structure constraints in linear programs
cites work: Testing of a large-scale network optimization program
cites work: Lectures on matroids
cites work: Optimal Capacity Scheduling—I
cites work: Q5588251
cites work: Automatic identification of embedded network rows in large-scale optimization models
description: scientific article; zbMATH DE number 4191394