New formulation and relaxation to solve a concave-cost network flow problem

Recommendations

A composite algorithm for a concave-cost network flow problem
Network optimization with piecewise linear convex costs
The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
scientific article; zbMATH DE number 1795722
LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions

Cited in

(23)

Coordination game analysis through penalty scheme in freight intermodal service
On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
A composite algorithm for a concave-cost network flow problem
On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
Minimal-cost network flow problems with variable lower bounds on arc flows
The design of service systems with queueing time cost, workload capacities and backup service
The plant location and flexible technology acquisition problem.
Single-warehouse multi-retailer inventory systems with full truckload shipments
Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
A combined matheuristic for the piecewise linear multicommodity network flow problem
Best routes selection in international intermodal networks
A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems
A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
A bilinear relaxation based algorithm for concave piecewise linear network flow problems
A conic quadratic formulation for a class of convex congestion functions in network flow problems
Solution procedures for the service system design problem
Network optimization with piecewise linear convex costs
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
scientific article; zbMATH DE number 1795722 (Why is no real title available?)
Fast heuristics for the time-constrained immobile server problem
The multi-hour service system design problem
Network cost minimization using threshold-based discounting

This page was built for publication: New formulation and relaxation to solve a concave-cost network flow problem

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