Pages that link to "Item:Q2574099"
From MaRDI portal
The following pages link to The complexity of minimum ratio spanning tree problems (Q2574099):
Displaying 5 items.
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
