𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An enumerative algorithm framework for a class of nonlinear integer programming problems

✍ Scribed by Mohamed Djerdjour

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
763 KB
Volume
101
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a framework for a branch and search algorithm for solving a class of general integer restricted, linearly constrained, quadratic integer programming problems where the objective function is a nonseparable quadratic concave function.

πŸ“œ SIMILAR VOLUMES

Optimization algorithms for a class of n
Optimization algorithms for a class of nonlinear programming problems
✍ S. Chowdhury; M.A. Breuer πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 371 KB

A generalization of the theory of materials of type N to continuum damage mechanics is presented. Then algorithms developed earlier by the authors for plasticity problems are extended and applied to the analysis of progressive damage of materials under large elastoplastic deformation. Results obtain

A greedy algorithm for some classes of i
A greedy algorithm for some classes of integer programs
✍ V.V. Shenmaier πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 144 KB

We establish a necessary and su cient condition for a greedy algorithm to ΓΏnd an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalizat