LP extreme points and cuts for the fixed-charge network design problem-Reference-Cited by-同舟云学术

LP extreme points and cuts for the fixed-charge network design problem

Published:1987-10 Issue:3 Volume:39 Page:263-284
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Balakrishnan Anantaram

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02592077.pdf

Reference21 articles.

1. A. Balakrishnan, “Valid inequalities and algorithms for the network design problem with an application to LTL consolidation,” Dissertation, Sloan School of Management, Massachusetts Institute of Technology (Cambridge, MA, 1984).

2. Working paper;A. Balakrishnan,1985

3. D.C. Cho, E.L. Johnson, M.W. Padberg and M.R. Rao, “On the uncapacitated plant location problem I: Valid inequalities and facets,”Mathematics of Operations Research 8 (1983a) 579–589.

4. D.C. Cho, M.W. Padberg and M.R. Rao, “On the uncapacitated plant location problem II: Facets and lifting theorems,”Mathematics of Operations Research 8 (1983b) 590–612.

5. V. Chvatal, “Edmonds polytopes and a hierarchy of combinatiorial problems,”Discrete Mathematics 4 (1973) 305–337

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

1. A survey on network design problems: main variants and resolution approaches;European J. of Industrial Engineering;2023

2. Fixed-Charge Network Design Problems;Network Design with Applications to Transportation and Logistics;2020-12-09

3. Optimization Model for Transportation of Container Cargoes considering Short Sea Shipping and External Cost;Transportation Research Record: Journal of the Transportation Research Board;2010-01

4. The generalized fixed-charge network design problem;Computers & Operations Research;2007-04

5. Optimization of Internet Protocol network design and routing;Networks;2003