Modeling and Solving the Two-Facility Capacitated Network Loading Problem
From MaRDI portal
Recommendations
- Capacitated Network Design—Polyhedral Structure and Computation
- A cutting plane algorithm for the capacitated connected facility location problem
- Polyhedral results for the edge capacity polytope.
- Bidirected and unidirected capacity installation in telecommunication networks.
- Capacitated facility location/network design problems.
Cited in
(74)- 0-1 reformulations of the multicommodity capacitated network design problem
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Source sink flows with capacity installation in batches
- Capacitated facility location: Separation algorithms and computational experience
- Minimum cost capacity installation for multicommodity network flows
- Economic spare capacity planning for DCS mesh-restorable networks
- Exact solution of multicommodity network optimization problems with general step cost functions
- Bidirected and unidirected capacity installation in telecommunication networks.
- Projections of the capacitated network loading problem
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Service network design in freight transportation
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- An exact algorithm for the modular hub location problem with single assignments
- Network loading problem: valid inequalities from 5- and higher partitions
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- A survey on Benders decomposition applied to fixed-charge network design problems
- Diversification strategies in local search for a nonbifurcated network loading problem
- Separating tight metric inequalities by bilevel programming
- Global optimization of multilevel electricity market models including network design and graph partitioning
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- Algorithms for the non-bifurcated network design problem
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- The multi-layered network design problem
- The robust network loading problem with dynamic routing
- A cutting plane algorithm for the capacitated connected facility location problem
- Revisiting Lagrangian relaxation for network design
- A note on capacity models for network design
- The splittable flow arc set with capacity and minimum load constraints
- Metric inequalities and the network loading problem
- On the capacitated concentrator location problem: a reformulation by discretization
- Towards optimizing the deployment of optical access networks
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Optimal solution of the discrete cost multicommodity network design problem
- Continuous knapsack sets with divisible capacities
- A partitioning algorithm for the network loading problem
- Discretized formulations for capacitated location problems with modular distribution costs
- Exact approaches to the single-source network loading problem
- Single-commodity robust network design with finite and hose demand sets
- Chance-constrained optimization of reliable fixed broadband wireless networks
- Survivable network design with shared-protection routing
- Polyhedral structure of the 4-node network design problem
- On cut-based inequalities for capacitated network design polyhedra
- Unsplittable non-additive capacitated network design using set functions polyhedra
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
- scientific article; zbMATH DE number 4053315 (Why is no real title available?)
- The network redesign problem for access telecommunications networks
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- Optimal network design with end-to-end service requirements
- Solving the two‐facility network design problem with 3‐partition facets
- Algorithms and extended formulations for one and two facility network design
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- Network Design Using Cut Inequalities
- Routing Through Virtual Paths in Layered Telecommunication Networks
- Robust network design: formulations, valid inequalities, and computations
- Benders decomposition approach for the robust network design problem with flow bifurcations
- A polyhedral study of the capacity formulation of the multilayer network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales
- Capacitated facility location/network design problems.
- A multi-period network design problem for cellular telecommunication systems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- ATM VP-based network design
- The continuous knapsack set
- Valid inequalities and facets for multi‐module survivable network design problem
- The convex hull of two core capacitated network design problems
- Cutting planes in integer and mixed integer programming
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Prize collecting Steiner trees with node degree dependent costs
- Network flow models for the local access network expansion problem
- Design of survivable IP-over-optical networks
- Partition inequalities for capacitated survivable network design based on directed p-cycles
This page was built for publication: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838244)
