Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
The Binary Integer Programming problem (BIP) is a mathematical optimization problem, with linear objective function and constraints, on which the domain of all variables is {0, 1}. In BIP, every variable is associated with a determined cost coefficient. The Minmax regret Binary Integer Programming p...
Saved in:
| Published in: | R.A.I.R.O. Recherche opérationnelle Vol. 56; no. 6; pp. 4281 - 4301 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.11.2022
|
| ISSN: | 0399-0559, 2804-7303 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!