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 OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011921025322 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1573105844 / rank | |||
Normal rank | |||
Latest revision as of 09:20, 30 July 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
