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

DOI10.1007/BF02592077zbMath0637.90095MaRDI QIDQ3778564

Anantaram Balakrishnan

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

directed networkplant locationfixed charge network designrouting multiple commodities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

The generalized fixed-charge network design problem, Facets and algorithms for capacitated lot sizing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly bipartite graphs and the max-cut problem
• Edmonds polytopes and a hierarchy of combinatorial problems
• A dual ascent approach for steiner tree problems on a directed graph
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• The even-path problem for graphs and digraphs
• Solving Large-Scale Zero-One Linear Programming Problems
• Tailoring Benders decomposition for uncapacitated network design
• A Dual-Based Procedure for Uncapacitated Facility Location
• Fractional vertices, cuts and facets of the simple plant location problem
• On Cutting Planes
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Some facets of the simple plant location polytope