Abstract: The Steelmaking-Continuous Casting (SCC) scheduling problem is usually regarded as a type of hybrid flow-shop scheduling problems (HFSP) with special process constraints. To research the SCC ...

Abstract: Give a finite undirected graph G = (V, E) and a positive integer κ ≥ 1, a distance-k matching is an edge set D ⊂ E that the pairwise distance of edges in D is at least k in G. The famous ...

cuADMM solves multi-block SDP problems of the form: $$\min_X \left\langle C,X\right\rangle \quad\text{s.t.}\quad \begin{cases} \left\langle A_i,X\right\rangle = b_i, \quad i\in [m]\\\ X\in\Omega_+ ...

You can set up the environment using the environment.yml (the requirement is the same as [DDRM]: https://github.com/bahjat-kawar/ddrm). Run conda env create -f ...