A restricted-entry method for a transportation problem with piecewise-linear concave costs-Reference-Cited by-同舟云学术

A restricted-entry method for a transportation problem with piecewise-linear concave costs

Published:1994-08 Issue:7 Volume:21 Page:723-733
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Nourie Francis J.,Güder Faruk

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference9 articles.

1. Minimization of nonlinear separable convex functionals;Charnes;Naval Res. logist. Q.,1954

2. An algorithm for solving the transportation problems when the shipping costs over each route is convex;Beale;Naval Res. loqist. Q.,1959

3. A simplex algorithm for piecewise-linear programming I: derivation and proof;Fourer;Mathl Program.,1985

4. A simplex algorithm for piecewise-linear programming III: computational analysis and applications;Fourer,1989

5. R. Fourer and R. E. Marsten, Solving piecewise-linear programs: experiment with a simplex approach, Technical Report 90-07, Dept. of Industrial Engineering and Management Sciences, Northwestern Univ. Evanston, IL 60208.

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

1. An ant colony system-based hybrid algorithm for square root concave cost transhipment problems;Engineering Optimization;2010-11

2. Global and Local Search Algorithms for Concave Cost Transshipment Problems;Journal of Global Optimization;2005-09

3. Domicile selection and risk pooling for trucking networks;IIE Transactions;2004-04

4. A Finite Algorithm for Global Minimization of Separable Concave Programs;Nonconvex Optimization and Its Applications;1996