Pages that link to "Item:Q2687057"
From MaRDI portal
The following pages link to On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057):
Displaying 8 items.
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- (Q3013421) (← links)
- (Q3204331) (← links)
- (Q3773696) (← links)
- (Q4504425) (← links)
- On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
- (Q5391189) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)