The practical conversion of linear programmes to network flow models

DOI10.1016/0377-2217(91)90264-VzbMATH Open0722.90045MaRDI QIDQ757237FDOQ757237

D. Kharzeev

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 5173820
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 795215
• A heuristic for finding embedded network structure in mathematical programmes
• scientific article

zbMATH Keywords

spanning treeequivalent problem transformationminimum cost network flow models

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Lectures on matroids
• Title not available (Why is that?)
• Optimal Capacity Scheduling—I
• Automatic identification of embedded network rows in large-scale optimization models
• Converting Linear Programs to Network Problems
• Title not available (Why is that?)
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• A good submatrix is hard to find
• Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
• Identification of special structure constraints in linear programs
• Determining GUB sets via an invert agenda algorithm
• Testing of a large-scale network optimization program
• A Control Problem of Bellman
• The practical conversion of linear programmes to network flow models

Cited In (6)

• Title not available (Why is that?)
• Detecting embedded pure network structures in LP problems
• A heuristic for finding embedded network structure in mathematical programmes
• The practical conversion of linear programmes to network flow models
• The out‐of‐kilter algorithm for solving network problems
• A recognition problem in converting linear programming to network flow models

This page was built for publication: The practical conversion of linear programmes to network flow models

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