THE LEXICO-SHORTEST ROUTE ALGORITHM FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT
DOI10.15807/JORSJ.26.167zbMATH Open0523.90041OpenAlexW2189368987MaRDI QIDQ3674380
Publication date: 1983
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.26.167
primal-dual methodone additional linear constraintlexico-shortest route algorithmminimal cost flow problemparametric network problems
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)
This page was built for publication: THE LEXICO-SHORTEST ROUTE ALGORITHM FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674380)
