Pages that link to "Item:Q4713238"
From MaRDI portal
The following pages link to Algorithms for solving a separable problem of discrete optimization (Q4713238):
Displaying 6 items.
- A bound-improving approach to discrete programming problems (Q1340059) (← links)
- A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773) (← links)
- (Q3002153) (← links)
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems (Q3032084) (← links)
- OPTi's Algorithm for Discreteness Determination (Q3413598) (← links)
- (Q4283695) (← links)