Pages that link to "Item:Q2480211"
From MaRDI portal
The following pages link to A note on the parametric maximum flow problem and some related reoptimization issues (Q2480211):
Displaying 11 items.
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- Parametric analysis on cut-trees and its application on a protein clustering problem (Q2303335) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- (Q2882852) (← links)
- Some recent contributions to network optimization (Q4812397) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
- Parametric matroid interdiction (Q6122085) (← links)
