Pages that link to "Item:Q1282208"

The following pages link to Approximation algorithms for certain network improvement problems (Q1282208):

Displaying 19 items.

• Optimizing budget allocation for center and median points (Q265070) (← links)
• Budget-constrained minimum cost flows (Q281825) (← links)
• A GRASP metaheuristic to improve accessibility after a disaster (Q647512) (← links)
• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (Q705041) (← links)
• Upgrading \(p\)-median problem on a path (Q894530) (← links)
• Reverse 2-median problem on trees (Q943832) (← links)
• Up- and downgrading the 1-center in a network (Q1026756) (← links)
• Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
• Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
• Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
• The non-approximability of bicriteria network design problems (Q1827279) (← links)
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
• On the optimum capacity of capacity expansion problems (Q2472185) (← links)
• A class of node based bottleneck improvement problems (Q2503225) (← links)
• Improving multicut in directed trees by upgrading nodes (Q2643926) (← links)
• Bottleneck Capacity Expansion Problems with General Budget Constraints (Q2765595) (← links)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
• The bus rapid transit investment problem (Q6568452) (← links)