Pages that link to "Item:Q281825"

The following pages link to Budget-constrained minimum cost flows (Q281825):

Displaying 7 items.

• A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
• A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
• A novel approach to subgraph selection with multiple weights on arcs (Q2168723) (← links)
• On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
• \(\Gamma\)-robust optimization of project scheduling problems (Q6065662) (← links)
• The complexity of the timetable‐based railway network design problem (Q6196872) (← links)