Pages that link to "Item:Q4327426"
From MaRDI portal
The following pages link to Improved Algorithms For Linear Inequalities with Two Variables Per Inequality (Q4327426):
Displayed 13 items.
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- Efficient non-myopic value-of-information computation for influence diagrams (Q962648) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
- The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
- On memoryless provers and insincere verifiers (Q3639202) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints (Q6169536) (← links)