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

DOI10.1057/PALGRAVE.JORS.2600363zbMATH Open0890.90060OpenAlexW1982811102MaRDI QIDQ4367015FDOQ4367015

Authors: Hasan Pirkul, Ali Amiri 

Publication date: 6 July 1998

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

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

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

zbMATH Keywords

heuristicLagrangian relaxationsnonlinear costcapacity selectionminimum cost, multicommodity network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cited In (22)

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

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)