Solving Graph Coloring Problem by integer Programming
バージョン 1.0.1 (3.31 MB) 作成者:
RMS Danaraj
% This code solves the Graoh node coloring problem. by binary integer programming(intlinprog).
% This code solves the node coloring problem.
% The data is taken from the coursera online course on discrete
% optimization.https://www.coursera.org/learn/discrete-optimization#about
%The python cpdess I developed for that course are reproduced
% in MATLAB.The data is in python index format.[counts from 0]
For high dimensions data change the default options of intlinprog.
https://salopower.blogspot.com/
引用
RMS Danaraj (2024). Solving Graph Coloring Problem by integer Programming (https://www.mathworks.com/matlabcentral/fileexchange/74133-solving-graph-coloring-problem-by-integer-programming), MATLAB Central File Exchange. に取得済み.
MATLAB リリースの互換性
作成:
R2019b
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linuxカテゴリ
Help Center および MATLAB Answers で Quadratic Programming and Cone Programming についてさらに検索
タグ
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!