Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems (Q5960735): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:50, 4 March 2024
scientific article; zbMATH DE number 1729461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems |
scientific article; zbMATH DE number 1729461 |
Statements
Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems (English)
0 references
2001
0 references
branch and bound
0 references
genetic algorithm
0 references
maximum satisfiability
0 references
