Pages that link to "Item:Q4349699"
From MaRDI portal
The following pages link to Edge Weight Reduction Problems in Directed Acyclic Graphs (Q4349699):
Displaying 15 items.
- 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)
- Up- and downgrading the 1-center in a network (Q1026756) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← 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)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← 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 budget-constrained flow improvement. (Q2583570) (← 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)
