LP extreme points and cuts for the fixed-charge network design problem
From MaRDI portal
Recommendations
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
- scientific article; zbMATH DE number 1947445
- The generalized fixed-charge network design problem
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- On two new formulations for the fixed charge network design problem with shortest path constraints
- LP Rounding Approximation Algorithms for Stochastic Network Design
- On the extremal solutions for capacitated network problems
- New models of the generalized fixed-charge network design problem
- On cut-based inequalities for capacitated network design polyhedra
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A Dual-Based Procedure for Uncapacitated Facility Location
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Edmonds polytopes and a hierarchy of combinatorial problems
- Fractional vertices, cuts and facets of the simple plant location problem
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 3559283 (Why is no real title available?)
- On Cutting Planes
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Solving Large-Scale Zero-One Linear Programming Problems
- Some facets of the simple plant location polytope
- Tailoring Benders decomposition for uncapacitated network design
- The even-path problem for graphs and digraphs
- Weakly bipartite graphs and the max-cut problem
Cited in
(17)- Fixed charge multicommodity network design using p-partition facets
- Fixed-charge transportation problems on trees
- Facets and algorithms for capacitated lot sizing
- On two new formulations for the fixed charge network design problem with shortest path constraints
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- The transit time constrained fixed charge multi-commodity network design problem
- Structural investigation of piecewise linearized network flow problems
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
- Analysis of a flow problem with fixed charges
- A characterization of the two-commodity network design problem
- The generalized fixed-charge network design problem
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
This page was built for publication: LP extreme points and cuts for the fixed-charge network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778564)
