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

DOI10.1057/PALGRAVE.JORS.2600363zbMath0890.90060OpenAlexW1982811102MaRDI QIDQ4367015

Hasan Pirkul, Ali Amiri

Publication date: 6 July 1998

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600363

zbMATH Keywords

heuristicLagrangian relaxationsnonlinear costcapacity selectionminimum cost, multicommodity network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (11)

Solution procedures for the service system design problem ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ Coordination game analysis through penalty scheme in freight intermodal service ⋮ Best routes selection in international intermodal networks ⋮ The multi-hour service system design problem ⋮ Single‐warehouse multi‐retailer inventory systems with full truckload shipments ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ The plant location and flexible technology acquisition problem. ⋮ Modeling and solving a multimodal transportation problem with flexible-time and scheduled services ⋮ The design of service systems with queueing time cost, workload capacities and backup service

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