Network optimization with piecewise linear convex costs

zbMATH Open1192.90026MaRDI QIDQ971452FDOQ971452

Authors: S. Ketabi 

Publication date: 14 May 2010

Published in: Iranian Journal of Science and Technology, Transactions A: Science (Search for Journal in Brave)

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

zbMATH Keywords

arc-path model, overflow modelFrank and Wolfe methodmulti-commodity network flow problempiecewise linear and convex costs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Nonlinear programming (90C30)

Cited In (14)

• 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
• Title not available (Why is that?)
• Network optimization and problems with coupling variables
• On large scale nonlinear network optimization
• Algorithms for network piecewise-linear programs: A comparative study
• Models for the piecewise linear unsplittable multicommodity flow problems
• Piecewise-linear networks with multimode service strategies
• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
• Title not available (Why is that?)
• Computer Algebra and Geometric Algebra with Applications
• Flot à coût convexe linéaire par morceaux
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs

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)