A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716)
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 recombination‐based matheuristic for mixed integer programming problems with binary variables |
scientific article; zbMATH DE number 7766430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recombination‐based matheuristic for mixed integer programming problems with binary variables |
scientific article; zbMATH DE number 7766430 |
Statements
A recombination‐based matheuristic for mixed integer programming problems with binary variables (English)
0 references
16 November 2023
0 references
combinatorial optimization
0 references
integer programming
0 references
metaheuristics
0 references
branch-and-bound
0 references
local search
0 references
0 references
0.8785626
0 references
0.8716468
0 references
0.8699025
0 references
0.8656693
0 references
0.8650515
0 references
0.86421394
0 references
0.86146045
0 references
0 references
0.85931194
0 references
