Network optimization with piecewise linear convex costs
From MaRDI portal
Publication:971452
Recommendations
- New formulation and relaxation to solve a concave-cost network flow problem
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
- Flot à coût convexe linéaire par morceaux
- scientific article; zbMATH DE number 1795722
- A composite algorithm for a concave-cost network flow problem
Cited in
(14)- Piecewise-linear networks with multimode service strategies
- Flot à coût convexe linéaire par morceaux
- Network optimization and problems with coupling variables
- scientific article; zbMATH DE number 4020868 (Why is no real title available?)
- On large scale nonlinear network optimization
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
- Computer Algebra and Geometric Algebra with Applications
- BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
- A note on optimization modelling of piecewise linear delay costing in the airline industry
- A combined matheuristic for the piecewise linear multicommodity network flow problem
- A piecewise linear upper bound on the network recourse function
- scientific article; zbMATH DE number 1795722 (Why is no real title available?)
- Models for the piecewise linear unsplittable multicommodity flow problems
- Algorithms for network piecewise-linear programs: A comparative study
This page was built for publication: Network optimization with piecewise linear convex costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971452)