scientific article; zbMATH DE number 1795722

MaRDI QIDQ4550771zbMATH OpenFDO

Authors Dukwon Kim, Panos M. Pardalos

Publication date 2002

zbMATH Keywords

minimum cost network flow problempiecewise linear cost function

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Flot à coût convexe linéaire par morceaux
• New formulation and relaxation to solve a concave-cost network flow problem
• Network optimization with piecewise linear convex costs
• scientific article; zbMATH DE number 1195629
• Algorithms for network piecewise-linear programs: A comparative study

Cited in

(14)

• Modelling piecewise linear concave costs in a tree partitioning problem
• A generator and a simplex solver for network piecewise linear programs
• Subdivision schemes, network flows and linear optimization
• Structural investigation of piecewise linearized network flow problems
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• scientific article; zbMATH DE number 5772889 (Why is no real title available?)
• Flot à coût convexe linéaire par morceaux
• scientific article; zbMATH DE number 3461750 (Why is no real title available?)
• New formulation and relaxation to solve a concave-cost network flow problem
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
• A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
• Efficient reformulation and solution of a nonlinear PDE-controlled flow network model
• Exact algorithms for procurement problems under a total quantity discount structure
• Network optimization with piecewise linear convex costs

This page was built for publication:

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