A composite algorithm for a concave-cost network flow problem-Reference-Cited by-同舟云学术

A composite algorithm for a concave-cost network flow problem

Published:1989-03 Issue:2 Volume:19 Page:175-202
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Balakrishnan Anantharam,Graves Stephen C.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference15 articles.

1. Valid Inequalities and Algorithms for the Network Design Problem with an Application to LTL Consolidation. Doctoral dissertation, Sloan School Management, Massachusetts Institute of Technology, Cambridge, MA (1984).

2. A note on two problems in connexion with graphs

3. Send-and-Split Method for Minimum-Concave-Cost Network Flows

4. The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited by 82 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New Formulations for the Scheduled Service Network Design Problem with Piecewise Linear Costs;International Series in Operations Research & Management Science;2024

2. Models for Network Flow and Network Design Problems with Piecewise Linear Costs;International Series in Operations Research & Management Science;2024

3. A Discussion on Non-Convex Optimization Problems Arising in Supply Chain Design and Finance;Advancement in Business Analytics Tools for Higher Financial Performance;2023-08-08

4. New formulations for the Scheduled Service Network Design Problem;Transportation Research Part B: Methodological;2023-06

5. Consolidation-Based Modeling for the Scheduled Service Network Design Problem;Logistics Management;2023