A hybrid algorithm for solving network flow problems with side constraints.
type: Item
instance of: scholarly article
title: A hybrid algorithm for solving network flow problems with side constraints.
zbMATH Open document ID: 1040.90556
DOI: 10.1016/S0305-0548(98)00001-X
author: S. Mathies
author: P. Mevert
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1975796
zbMATH Keywords: Network optimization
zbMATH Keywords: side constraints
zbMATH Keywords: basis partitioning
describes a project that uses: MOPS
MaRDI profile type: Publication
cites work: Q3056948
cites work: Q4845363
cites work: Q4834366
cites work: Network flow problems with one side constraint: A comparison of three solution methods
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: A primal algorithm for solving a capacitated network flow problem with additional linear constraints
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
cites work: The simplex SON algorithm for LP/embedded network problems
cites work: Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
cites work: Validation of subgradient optimization
cites work: Q4845364
cites work: Q3968758
cites work: An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
cites work: MOPS -- Mathematical optimization system
cites work: A surrogate and Lagrangian approach to constrained network problems
description: scientific article; zbMATH DE number 1975796