joey001 Goto Github PK

algforopt-notebooks

Jupyter notebooks associated with the Algorithms for Optimization textbook

algorithmengineeringlab

benchmark

graph benchmark

clique-partitioning

Local search algorithm to solve clique parition problem

clique-problem

A collection of codes for clique problems

cnc_remastered_collection

cohesive_subgraph_book

dapcstp

enu-k-bundle

exactcolors

Automatically exported from code.google.com/p/exactcolors

faplex

format

ACM consolidated LaTeX styles

hungarian-cpp

Automatically exported from code.google.com/p/hungarian-cpp

joey001.github.io

k-vertex-cut-problem

This repository contains the code used for the computational experiments of: "F. Furini, I. Ljubic, E. Malaguti, P. Paronuzzi: On Integer and Bilevel Formulations for the k-Vertex Cut Problem, Mathematical Programming Computation, to appear 2019"

kplex_degen_gap

The maximum k-plex algorithm parameterized by the degeneracy gap.

listplex

A fast maximal k-plex listing algorithm in the WWW22 Paper.

max-s-bundle

maximumclique

The implementation for maximum clique enumeration algorithm

mbbp

Effective algorithms for maximum bipartite biclique problem

mbbp_exact

The exact algorithms for Maximum Balanced Biclique Problem

mosaic-gen

optimization

code for learning Optimization tech

pbbs

A Copy of the Problem Based Benchmark Suite (http://www.cs.cmu.edu/~pbbs/)

quasiclq

This algorithm solves maximum quasi-clique

relaxclq

A package for finding large clique and relaxed cliques

splex-big

Frequency driven multi-neighborhood tabu search for the maximum s-plex problem