Pages that link to "Item:Q2183215"
From MaRDI portal
The following pages link to An implementation of steepest-descent augmentation for linear programs (Q2183215):
Displaying 7 items.
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Constructing Clustering Transformations (Q5150815) (← links)
- An implementation of steepest-descent augmentation for linear programs (Q6329523) (← links)
- On circuit diameter bounds via circuit imbalances (Q6589764) (← links)