Pages that link to "Item:Q1274323"

The following pages link to Modifying edges of a network to obtain short subgraphs (Q1274323):

Displaying 21 items.

• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (Q705041) (← links)
• Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
• Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← 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)
• Improving spanning trees by upgrading nodes (Q1960523) (← 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)
• A class of node based bottleneck improvement problems (Q2503225) (← links)
• Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
• On budget-constrained flow improvement. (Q2583570) (← links)
• Bottleneck Capacity Expansion Problems with General Budget Constraints (Q2765595) (← links)
• Upgrading trees under diameter and budget constraints (Q4797944) (← links)
• Upgrading edges in the graphical TSP (Q6047867) (← links)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
• Speedup the optimization of maximal closure of a node-weighted directed acyclic graph (Q6105899) (← links)