LP extreme points and cuts for the fixed-charge network design problem
- 1 October 1987
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 39 (3) , 263-284
- https://doi.org/10.1007/bf02592077
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Tailoring Benders decomposition for uncapacitated network designPublished by Springer Nature ,1986
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting TheoremsMathematics of Operations Research, 1983
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and FacetsMathematics of Operations Research, 1983
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Some facets of the simple plant location polytopeMathematical Programming, 1982
- Weakly bipartite graphs and the Max-cut problemOperations Research Letters, 1981
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- On the Uncapacitated Location ProblemPublished by Elsevier ,1977
- Experiments in the formulation of integer programming problemsPublished by Springer Nature ,1974