Local methods for solving one class of integer linear programming problems (Q1569330): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q179098 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Alexey A. Tret'yakov / rank | |||
Normal rank | |||
Revision as of 09:59, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local methods for solving one class of integer linear programming problems |
scientific article |
Statements
Local methods for solving one class of integer linear programming problems (English)
0 references
2 July 2000
0 references
This paper describes several procedures for the determination of local minima of Boolean linear programming problems whose linear functionals and linear constraints have nonnegative coefficients. Each of these procedures was developed for the problems with singularities in order to find a local minimum close to the global one. The procedures developed are used to construct several approximate algorithms of the ``local-search'' type that differ in accuracy and complexity.
0 references
Boolean programming
0 references
local-search
0 references
approximate algorithm
0 references
