Using shortest paths in some transshipment problems with concave costs

DOI10.1007/BF01593766MaRDI QIDQ4145180zbMATH OpenFDO

Authors Gery Daeninck, Yves Smeers

Publication date 1977

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01593766

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Cites work

• A note on two problems in connexion with graphs
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A Simplex Method for a Class of Nonconvex Separable Problems
• Adjacent vertices on transportation polytopes
• An improved version of the out-of-kilter method and a comparative study of computer codes
• Augmented Threaded Index Method For Network Optimization
• Concave minimization over a convex polyhedron
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Solving the Fixed Charge Problem by Ranking the Extreme Points

Cited in

(2)

• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms

This page was built for publication: Using shortest paths in some transshipment problems with concave costs

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