Skip to content

Latest commit

 

History

History
20 lines (16 loc) · 787 Bytes

README.md

File metadata and controls

20 lines (16 loc) · 787 Bytes

CAP problem

Binder

Introduction

In this repo, we are trying to show several demos to cover classic coloring problem (COL) and container allocation problem (CAP) where we will discuss:

  • Given k colors, whether one graph is colorable and the minimum k to make it colorable
  • With k boxes (containers), whether an instance is allocable and the minimum k to make it allocable

Besides this, we provide a demo to illustrate

  • how can we use Answer Set Programming (ASP) to verify that k-COL can be reduced to k-CAP

Binder

we provide binder for easy use without installing any packages locally

Conda Env

conda env create -f environment.yml
conda activate cap
jupyter notebook