The following pages link to (Q3013421):
Displaying 10 items.
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- (Q3035143) (← links)
- (Q3985788) (← links)
- (Q4504425) (← links)
- A strongly polynomial algorithm for bimodular integer linear programming (Q4978060) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- Polynomial algorithms for the synthesis of bounded nets (Q5096743) (← links)
- Large final polynomials from integer programming (Q5101999) (← links)
- Fully Bounded Polyhedral Analysis of Integers with Wrapping (Q5170176) (← links)