A Simulated Annealing Algorithm for General Zero-One Programming Problems (Q3360004)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Simulated Annealing Algorithm for General Zero-One Programming Problems |
scientific article; zbMATH DE number 4211806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Simulated Annealing Algorithm for General Zero-One Programming Problems |
scientific article; zbMATH DE number 4211806 |
Statements
A Simulated Annealing Algorithm for General Zero-One Programming Problems (English)
0 references
1991
0 references
simulated annealing
0 references
zero-one programming
0 references
branch and bound
0 references
Pivot and Complement heuristic
0 references
cutting planes
0 references
multiconstraint knapsack problems
0 references
0.8372024297714233
0 references
0.8361349701881409
0 references
0.8326061367988586
0 references
0.8264757990837097
0 references
0.796847403049469
0 references
