A note on the pivot and complement heuristic for 0-1 programming problems (Q1113801): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: XMP / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90028-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2088896926 / rank | |||
Normal rank |
Latest revision as of 08:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the pivot and complement heuristic for 0-1 programming problems |
scientific article |
Statements
A note on the pivot and complement heuristic for 0-1 programming problems (English)
0 references
1989
0 references
When solving large scale integer and mixed integer programming problems it is very important to find good feasible integer solutions at an early stage in the solution process. The pivot and complement heuristic is a procedure which very often generates good solutions at a relatively low computational cost. In this paper we demonstrate that repeated use of the pivot and complement heuristic with an additional objective function constraint, often gives a better solution than the one obtained in the first trial. We present some results obtained on a number of practical large scale problems of project sequencing type.
0 references
good feasible integer solutions
0 references
pivot and complement heuristic
0 references
large scale problems
0 references
project sequencing
0 references