Pages that link to "Item:Q2392120"
From MaRDI portal
The following pages link to A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120):
Displaying 8 items.
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (Q2399489) (← links)
- The complexity of minimum ratio spanning tree problems (Q2574099) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)