Pages that link to "Item:Q4838244"
From MaRDI portal
The following pages link to Modeling and Solving the Two-Facility Capacitated Network Loading Problem (Q4838244):
Displaying 50 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Survivable network design with shared-protection routing (Q296897) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- ATM VP-based network design (Q596263) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
- Network flow models for the local access network expansion problem (Q856692) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- Source sink flows with capacity installation in batches (Q1130180) (← links)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
- Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
- Economic spare capacity planning for DCS mesh-restorable networks (Q1303707) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
- A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints (Q2288988) (← links)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- The splittable flow arc set with capacity and minimum load constraints (Q2450712) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- A partitioning algorithm for the network loading problem (Q2654332) (← links)
- Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
