The convex hull of two core capacitated network design problems
From MaRDI portal
(Redirected from Publication:689128)
Recommendations
- Capacitated Network Design—Polyhedral Structure and Computation
- A concavity result for network design problems
- On capacitated network design cut-set polyhedra
- A polyhedral approach for solving two facility network design problem
- Approximability of capacitated network design
- Approximability of capacitated network design
- A polyhedral study of the capacity formulation of the multilayer network design problem
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- scientific article; zbMATH DE number 2132072
- On the extremal solutions for capacitated network problems
Cites work
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Matroids and the greedy algorithm
- Maximum matching and a polyhedron with 0,1-vertices
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
- Solving Large-Scale Zero-One Linear Programming Problems
- The perfectly matchable subgraph polytope of a bipartite graph
- The perfectly matchable subgraph polytope of an arbitrary graph
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(47)- On the extremal solutions for capacitated network problems
- Generalized coefficient strengthening cuts for mixed integer programming
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Continuous knapsack sets with divisible capacities
- Diversification strategies in local search for a nonbifurcated network loading problem
- A stabilized structured Dantzig-Wolfe decomposition method
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Revisiting Lagrangian relaxation for network design
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- The continuous knapsack set
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Branch-and-price-and-cut for a service network design and hub location problem
- Chance-constrained optimization of reliable fixed broadband wireless networks
- Single-commodity robust network design with finite and hose demand sets
- Valid inequalities for the single arc design problem with set-ups
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- Survivable network design with shared-protection routing
- Design of survivable IP-over-optical networks
- Bidirected and unidirected capacity installation in telecommunication networks.
- A note on capacity models for network design
- Lifting for mixed integer programs with variable upper bounds
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Network loading problem: valid inequalities from 5- and higher partitions
- Partition inequalities for capacitated survivable network design based on directed p-cycles
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Cover and pack inequalities for (mixed) integer programming
- Projections of the capacitated network loading problem
- Service network design in freight transportation
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- Unsplittable non-additive capacitated network design using set functions polyhedra
- The Two Level Network Design Problem with Secondary Hop Constraints
- A polyhedral study of the capacity formulation of the multilayer network design problem
- Algorithms for the non-bifurcated network design problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- The splittable flow arc set with capacity and minimum load constraints
- Optimization in telecommunication networks
- The robust network loading problem with dynamic routing
- A polyhedral study of the semi-continuous knapsack problem
- Fixed charge multicommodity network design using p-partition facets
- Benders decomposition for capacitated network design
- Robust gateway placement in wireless mesh networks
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Separating tight metric inequalities by bilevel programming
- The two layer network design problem
- On cut-based inequalities for capacitated network design polyhedra
- Polyhedral structure of the 4-node network design problem
- Discretized formulations for capacitated location problems with modular distribution costs
This page was built for publication: The convex hull of two core capacitated network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689128)
