Pages that link to "Item:Q5009590"
From MaRDI portal
The following pages link to On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590):
Displaying 14 items.
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- (Q3013421) (← links)
- (Q3204331) (← links)
- (Q3773696) (← links)
- (Q4504425) (← links)
- (Q4607934) (← links)
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma (Q4973054) (← links)
- On Integer Programming and Convolution. (Q5090420) (← links)
- (Q5090494) (← links)
- (Q5391189) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)