Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems (Q5960735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1729461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7574587464332581
0 references
0.7559226155281067
0 references
0.7547762989997864
0 references
0.7515339255332947
0 references
