Pages that link to "Item:Q2494305"
From MaRDI portal
The following pages link to A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (Q2494305):
Displaying 8 items.
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem (Q2029281) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
