Pages that link to "Item:Q3793961"
From MaRDI portal
The following pages link to Computational Complexity of Some Problems in Parametric Discrete Programming. I (Q3793961):
Displaying 9 items.
- Parameterisation algorithms for the integer linear programs in binary variables (Q795729) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- A primal dual integer programming algorithm (Q1309813) (← links)
- On the complexity of a special basis problem in LP (Q1315997) (← links)
- Constructing the value function for an integer linear programme over a cone (Q1918916) (← links)
- Linear programming with variable matrix entries (Q2488219) (← links)
- (Q3161327) (← links)
- Parametric Integer Programming in Fixed Dimension (Q3168997) (← links)
- Parametric integer programming (Q3199194) (← links)