-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCITATION.cff
More file actions
45 lines (45 loc) · 1.46 KB
/
Copy pathCITATION.cff
File metadata and controls
45 lines (45 loc) · 1.46 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
cff-version: 1.2.0
message: >-
If you use coldcore, please cite the software using the metadata
below; the preferred citation is the records paper it grew out of.
title: coldcore
abstract: >-
GPU framework for exhaustive-coverage combinatorial optimization:
exact whole-space gain/loss transforms behind a plugin ABI, with a
problem-agnostic search core (exact lazy greedy, LNS, notch descent)
for covering codes, dominating sets, and related problems.
type: software
version: 0.2.2
date-released: 2026-09-04
license: MIT
repository-code: 'https://github.com/Mapika/coldcore'
authors:
- family-names: Marosi
given-names: Mark
email: marosi@mit.bme.hu
orcid: 'https://orcid.org/0009-0002-7203-3533'
affiliation: >-
Department of Artificial Intelligence and Systems Engineering,
Budapest University of Technology and Economics
keywords:
- covering codes
- dominating sets
- combinatorial optimization
- large neighborhood search
- CUDA
- GPU
preferred-citation:
type: article
title: >-
New upper and lower bounds on covering codes K_q(n,R) for alphabets
of size 5 <= q <= 21
authors:
- family-names: Marosi
given-names: Mark
orcid: 'https://orcid.org/0009-0002-7203-3533'
affiliation: >-
Department of Artificial Intelligence and Systems Engineering,
Budapest University of Technology and Economics
year: 2026
doi: 10.48550/arXiv.2608.19872
url: 'https://arxiv.org/abs/2608.19872'