A heuristic for the non-unicost set covering problem using local branching
J.E. Beasley
| Year of publication: |
2024
|
|---|---|
| Authors: | Beasley, John E. |
| Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 31.2024, 5, p. 2807-2825
|
| Subject: | Hamming distance | integer programming | local branching | matheuristic | neighbourhood search | set covering | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming |
freely available
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1111/itor.13446 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014533444