
AbstractAn exact method for solving all-integer non-linear programming problems with a separable non-decreasing objective function is presented. Dynamic programming methodology is used to efficiently search candidate hypersurfaces for the optimal feasible integer solution. An efficient computational and storage scheme exists and initial calculations give very promising results.
Computational Mathematics, Computational Theory and Mathematics, Nonlinear programming, Modelling and Simulation, Integer programming
Computational Mathematics, Computational Theory and Mathematics, Nonlinear programming, Modelling and Simulation, Integer programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
