A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
From MaRDI portal
Publication:1889860
DOI10.1007/s00453-004-1085-2zbMath1134.90512OpenAlexW2169278451WikidataQ59592499 ScholiaQ59592499MaRDI QIDQ1889860
Ravindra K. Ahuja, James B. Orlin, Dorit S. Hochbaum
Publication date: 13 December 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1085-2
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Strong formulations for quadratic optimization with M-matrices and indicator variables, Applications and efficient algorithms for integer programming problems on monotone constraints, Unnamed Item, A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems, L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem, Complexity and algorithms for nonlinear optimization problems, Global optimization for first order Markov random fields with submodular priors, New algorithms for convex cost tension problem with application to computer vision, Decreasing minimization on M-convex sets: background and structures, Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
