Science Score: 57.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
    Found CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
    Found .zenodo.json file
  • DOI references
    Found 4 DOI reference(s) in README
  • Academic publication links
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (6.5%) to scientific vocabulary
Last synced: 7 months ago · JSON representation ·

Repository

Basic Info
  • Host: GitHub
  • Owner: d4v1d-cub
  • Language: C
  • Default Branch: main
  • Size: 31.2 MB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 1
Created 11 months ago · Last pushed 11 months ago
Metadata Files
Readme Citation

README.md

Algorithmic thresholds in combinatorial optimization depend on the time scaling

Introduction

This repository contains all the code used to generate data for the article "Algorithmic thresholds in combinatorial optimization depend on the time scaling" (arxiv). The user can find programs to: * Run the Simulated Annealing algorithm for K-SAT and q-coloring problems. * Run the Focused Metropolis Search (FMS) algorithm on K-SAT instances. * Run the zero-temperature Monte Carlo on K-SAT instances.

It also contains all the data and scripts necessary to reproduce all the figures in the paper.

List of the different programs

  • SAclustersmod.c (Simulated Annealing for q-coloring) [Location: Programs/COL/SimulatedAnnealing]
  • SA_K-SAT.c (Simulated Annealing for K-SAT) [Location: Programs/SAT/SimulatedAnnealing/FiniteSize]
  • SA_KSAT.jl (Simulated Annealing for K-SAT) [Location: Programs/SAT/SimulatedAnnealing/InfiniteSize]
  • wfacwsat.c (Focused Metropolis Search for K-SAT) [Location: Programs/SAT/FMS]
  • quench_K-SAT.c (zero-temperature Monte Carlo for K-SAT) [Location: Programs/SAT/MCT0]

The user can find README.md files for each ones of these programs.

Data

The folder Results/ contains all of the data necessary to reobtain the figures in our paper (arxiv).

Its structure of the whole repository is:

├── Plots │   ├── Fig1 │   ├── Fig2 │   ├── Fig3 │   ├── Fig4 │   ├── Fig5 │   ├── Fig6 │   ├── Fig7 │   ├── Fig8 │   └── Fig9 ├── Programs │   ├── COL │   │   └── SimulatedAnnealing │   └── SAT │   ├── FMS │   ├── MCT0 │   └── SimulatedAnnealing │   ├── FiniteSize │   └── InfiniteSize │   └── SimAnnProj └── Results ├── COL │   └── SimulatedAnnealing │   ├── AllData │   └── ProcessedData └── SAT ├── FMS │   ├── AllData │   └── ProcessedData ├── MCT0 │   └── AllData └── SimulatedAnnealing ├── FiniteSize │   ├── AllData │   └── ProcessedData └── InfiniteSize ├── Average │   ├── K_3 │   ├── K_4 │   └── K_5 └── MINIMAX ├── K_3 ├── K_4 └── K_5

The folders called AllData contain raw data, while ProcessedData contain the files that are direcly used to produce the figures. Names are informative of the contents.

Plots

The folder /Plots contains all the plots and the corresponding gnuplot scripts. Each one is prepared to be run as it is, reading the data in the folder Results/ and producing the figure.

References

[1] Sakari Seitz, Mikko Alava and Pekka Orponen. Focused local search for random 3-satisfiability. J. Stat. Mech. Teory Exp., P06006 (2005).

Owner

  • Login: d4v1d-cub
  • Kind: user

Citation (CITATION.cff)

cff-version: 1.0.0
message: "If you use this software, please cite it as below."
title: "Algorithmic thresholds in combinatorial optimization depend on the time scaling"
version: 1.1.1
authors:
  - family-names: "Machado"
    given-names: "David"
    orcid: "https://orcid.org/0000-0002-2498-8098"
identifiers:
  - type: doi
    value: 10.5281/zenodo.15363806
date-released: 2025-05-08

GitHub Events

Total
  • Release event: 2
  • Push event: 8
  • Create event: 4
Last Year
  • Release event: 2
  • Push event: 8
  • Create event: 4