Pages that link to "Item:Q1433661"
From MaRDI portal
The following pages link to Monotonizing linear programs with up to two nonzeroes per column (Q1433661):
Displaying 9 items.
- Approximability of sparse integer programs (Q634673) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- An analytical approach to the inference of summary data of additive type (Q2456376) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- On the simplex algorithm for networks and generalized networks (Q3722234) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
