An algorithm of local search for a class of problems of integer linear programming (Q1974748): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:26, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm of local search for a class of problems of integer linear programming |
scientific article |
Statements
An algorithm of local search for a class of problems of integer linear programming (English)
0 references
19 June 2000
0 references
The paper is devoted to the problem of Boolean linear programming with nonnegative coefficients of the linear functional and linear constraints. The author has proposed an algorithm of the local search type. It is based on two procedures of search for a local minimum of the linear programming problem. As a result of application of the developed procedures a set of admissible local minima for the functional has been constructed, among which the optimal one chosen is an approximation to the exact solution of the problem.
0 references
Boolean linear programming
0 references
algorithm
0 references