𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm for a class of integer programming problems with implicit constraints

✍ Scribed by V. P. Tretyak; O. V. Lyashko

Publisher
Springer US
Year
1994
Tongue
English
Weight
309 KB
Volume
30
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An enumerative algorithm framework for a
An enumerative algorithm framework for a class of nonlinear integer programming problems
✍ Mohamed Djerdjour πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 763 KB

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.

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