Some branch-and-bound procedures for fixed-cost transportation problems-Reference-Cited by-同舟云学术

Some branch-and-bound procedures for fixed-cost transportation problems

Published:1984-03 Issue:1 Volume:31 Page:145-154
ISSN:0028-1441
Container-title:Naval Research Logistics Quarterly
language:en
Short-container-title:Naval Research Logistics

Author:

Cabot A. Victor,Erenguc S. Selcuk

Publisher

Wiley

Subject

General Engineering

Reference6 articles.

1. Fixed-cost transportation problems

2. A New Optimization Method for Large Scale Fixed Charge Transportation Problems

3. and , “Improved Penalties for Fixed Cost Linear Programs Using Lagrangian Relaxation,” CEDS, Discussion Paper No. 87, University of Florida, College of Business Administration, Gainesville, FL.

4. Linear Programming and Extensions, Princeton U. P., Princeton, NJ, 1963.

5. Technical Note—Exact Solution of the Fixed-Charge Transportation Problem

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

1. Improved Lagrangian-relaxation based approaches for multi-period multi-stage fixed charge transportation problem;International Journal of Systems Science: Operations & Logistics;2023-06-21

2. Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm;International Journal of System Assurance Engineering and Management;2021-06-29

3. Exact Methods for Fixed-Charge Network Design;Network Design with Applications to Transportation and Logistics;2020-12-09

4. Solving Multi-objective Fixed Charged Transportation Problem Using a Modified Particle Swarm Optimization Algorithm;Evolutionary Computing and Mobile Sustainable Networks;2020-08-01

5. Optimal network flow: A predictive analytics perspective on the fixed-charge network flow problem;Computers & Industrial Engineering;2016-09