Pages that link to "Item:Q1879243"

The following pages link to Approximation algorithms for a capacitated network design problem (Q1879243):

Displaying 28 items.

• On fixed cost \(k\)-flow problems (Q260248) (← links)
• Approximating capacitated tree-routings in networks (Q630195) (← links)
• Approximating some network design problems with node costs (Q638508) (← links)
• An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296) (← links)
• On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
• Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
• Approximating the \(k\)-splittable capacitated network design problem (Q1751198) (← links)
• A branch-and-cut algorithm for capacitated network design problems (Q1806022) (← links)
• Improved approximation for fractionally subadditive network design (Q2011025) (← links)
• Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
• Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
• Network design with a discrete set of traffic matrices (Q2450673) (← links)
• A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
• Solving the capacitated local access network design problem (Q2901009) (← links)
• On the approximability of some network design problems (Q2921762) (← links)
• Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
• Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
• (Q3128880) (← links)
• Risk Based Optimization of Electronics Manufacturing Supply Chains (Q3299237) (← links)
• Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
• (Q3826339) (← links)
• Algorithms for a network design problem with crossing supermodular demands (Q4474300) (← links)
• Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
• Algorithms and extended formulations for one and two facility network design (Q4645912) (← links)
• Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
• Approximation to the Minimum Cost Edge Installation Problem (Q5387765) (← links)
• Approximating Capacitated Tree-Routings in Networks (Q5425447) (← links)
• Automata, Languages and Programming (Q5466515) (← links)