Pages that link to "Item:Q4303922"
From MaRDI portal
The following pages link to The scheme complexity of discrete optimization (Q4303922):
Displaying 5 items.
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773) (← links)
- (Q3161327) (← links)
- OPTi's Algorithm for Discreteness Determination (Q3413598) (← links)
- On the Complexity of 2D Discrete Fixed Point Problem (Q3613784) (← links)