C

cis

Finds a maximum-profit subset of jobs that can be processed without time or resource conflict

Project ID: 1918975
Name
Last commit
Last update
instances Loading commit data...
CMakeLists.txt Loading commit data...
EfficientSet.hpp Loading commit data...
README.md Loading commit data...
SubsetIterator.hpp Loading commit data...
cis.cpp Loading commit data...
color_set.hpp Loading commit data...
config.h.in Loading commit data...
dynprog.cpp Loading commit data...
dynprog.hpp Loading commit data...
graph.cig Loading commit data...
interval_graph.cpp Loading commit data...
interval_graph.hpp Loading commit data...
preprocessing.cpp Loading commit data...
preprocessing.hpp Loading commit data...
search_tree_omega.cpp Loading commit data...
search_tree_omega.hpp Loading commit data...