-
Notifications
You must be signed in to change notification settings - Fork 24
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #171 from IOHprofiler/doc_python
[WIP] Update problem documentation python
- Loading branch information
Showing
80 changed files
with
2,250 additions
and
243 deletions.
There are no files selected for viewing
Binary file added
BIN
+12.1 KB
docs/_images/inheritance-281e43c13315f8223ba1e900ab36ca0f1c43dc04.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
8 changes: 8 additions & 0 deletions
8
docs/_images/inheritance-281e43c13315f8223ba1e900ab36ca0f1c43dc04.png.map
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,8 @@ | ||
| <map id="inheritance8d65a00182" name="inheritance8d65a00182"> | ||
| <area shape="rect" id="node1" href="../api/ioh.iohcpp.problem.GraphProblem.html#ioh.iohcpp.problem.GraphProblem" target="_top" title="Graph-based problems (submodular problems)" alt="" coords="401,80,516,105"/> | ||
| <area shape="rect" id="node4" href="../api/ioh.iohcpp.problem.MaxCoverage.html#ioh.iohcpp.problem.MaxCoverage" target="_top" title="Max-Coverage problems" alt="" coords="572,5,684,31"/> | ||
| <area shape="rect" id="node5" href="../api/ioh.iohcpp.problem.MaxCut.html#ioh.iohcpp.problem.MaxCut" target="_top" title="Max-Cut problems" alt="" coords="592,55,664,80"/> | ||
| <area shape="rect" id="node6" href="../api/ioh.iohcpp.problem.MaxInfluence.html#ioh.iohcpp.problem.MaxInfluence" target="_top" title="Max-Influence problems" alt="" coords="573,104,683,129"/> | ||
| <area shape="rect" id="node7" href="../api/ioh.iohcpp.problem.PackWhileTravel.html#ioh.iohcpp.problem.PackWhileTravel" target="_top" title="Packing while traveling problems" alt="" coords="564,153,692,179"/> | ||
| <area shape="rect" id="node2" href="../api/ioh.iohcpp.problem.IntegerSingleObjective.html#ioh.iohcpp.problem.IntegerSingleObjective" target="_top" title="IntegerSingleObjective" alt="" coords="183,80,353,105"/> | ||
| </map> |
Binary file added
BIN
+83.8 KB
docs/_images/inheritance-30bac92ed56dfcb8f7f5f852e14bf07e839b9ab2.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
30 changes: 30 additions & 0 deletions
30
docs/_images/inheritance-30bac92ed56dfcb8f7f5f852e14bf07e839b9ab2.png.map
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,30 @@ | ||
| <map id="inheritanceb56d784816" name="inheritanceb56d784816"> | ||
| <area shape="rect" id="node1" href="../api/ioh.iohcpp.problem.ConcatenatedTrap.html#ioh.iohcpp.problem.ConcatenatedTrap" target="_top" title="Concatenated Trap (CT) is defined by partitioning a bit-string into segments of length k and " alt="" coords="540,5,676,30"/> | ||
| <area shape="rect" id="node2" href="../api/ioh.iohcpp.problem.PBO.html#ioh.iohcpp.problem.PBO" target="_top" title="Pseudo-Boolean Optimization (PBO) problem set." alt="" coords="395,564,466,589"/> | ||
| <area shape="rect" id="node5" href="../api/ioh.iohcpp.problem.IsingRing.html#ioh.iohcpp.problem.IsingRing" target="_top" title="The Ising Spin Glass model arose in solid-state physics and statistical mechanics, aiming to " alt="" coords="567,54,649,79"/> | ||
| <area shape="rect" id="node6" href="../api/ioh.iohcpp.problem.IsingTorus.html#ioh.iohcpp.problem.IsingTorus" target="_top" title="The Ising Spin Glass model arose in solid-state physics and statistical mechanics, aiming to " alt="" coords="566,102,651,127"/> | ||
| <area shape="rect" id="node7" href="../api/ioh.iohcpp.problem.IsingTriangular.html#ioh.iohcpp.problem.IsingTriangular" target="_top" title="The Ising Spin Glass model arose in solid-state physics and statistical mechanics, aiming to " alt="" coords="550,151,666,176"/> | ||
| <area shape="rect" id="node8" href="../api/ioh.iohcpp.problem.LABS.html#ioh.iohcpp.problem.LABS" target="_top" title="Low Autocorrelation Binary Sequences (LABS):" alt="" coords="573,199,644,224"/> | ||
| <area shape="rect" id="node9" href="../api/ioh.iohcpp.problem.LeadingOnes.html#ioh.iohcpp.problem.LeadingOnes" target="_top" title="LeadingOnes:" alt="" coords="556,248,661,273"/> | ||
| <area shape="rect" id="node10" href="../api/ioh.iohcpp.problem.LeadingOnesDummy1.html#ioh.iohcpp.problem.LeadingOnesDummy1" target="_top" title="A variant of LeadingOnes applying the Dummy transformation of W-model. m = 0.5n." alt="" coords="526,297,690,321"/> | ||
| <area shape="rect" id="node11" href="../api/ioh.iohcpp.problem.LeadingOnesDummy2.html#ioh.iohcpp.problem.LeadingOnesDummy2" target="_top" title="A variant of LeadingOnes applying the Dummy transformation of W-model. m = 0.9n." alt="" coords="526,345,690,370"/> | ||
| <area shape="rect" id="node12" href="../api/ioh.iohcpp.problem.LeadingOnesEpistasis.html#ioh.iohcpp.problem.LeadingOnesEpistasis" target="_top" title="A variant of LeadingOnes applying the Epistasis transformation of W-model. | ||
| u = 4." alt="" coords="527,394,689,419"/> | ||
| <area shape="rect" id="node13" href="../api/ioh.iohcpp.problem.LeadingOnesNeutrality.html#ioh.iohcpp.problem.LeadingOnesNeutrality" target="_top" title="A variant of LeadingOnes applying the Neutrality transformation of W-model. mu = 3." alt="" coords="524,442,692,467"/> | ||
| <area shape="rect" id="node14" href="../api/ioh.iohcpp.problem.LeadingOnesRuggedness1.html#ioh.iohcpp.problem.LeadingOnesRuggedness1" target="_top" title="A variant of LeadingOnes applying the first Ruggnedness transformation in https://doi.org/10.1016/j.asoc.2019.106027." alt="" coords="513,491,703,516"/> | ||
| <area shape="rect" id="node15" href="../api/ioh.iohcpp.problem.LeadingOnesRuggedness2.html#ioh.iohcpp.problem.LeadingOnesRuggedness2" target="_top" title="A variant of LeadingOnes applying the second Ruggnedness transformation in https://doi.org/10.1016/j.asoc.2019.106027." alt="" coords="513,539,703,564"/> | ||
| <area shape="rect" id="node16" href="../api/ioh.iohcpp.problem.LeadingOnesRuggedness3.html#ioh.iohcpp.problem.LeadingOnesRuggedness3" target="_top" title="A variant of LeadingOnes applying the third Ruggnedness transformation in https://doi.org/10.1016/j.asoc.2019.106027." alt="" coords="513,588,703,613"/> | ||
| <area shape="rect" id="node17" href="../api/ioh.iohcpp.problem.Linear.html#ioh.iohcpp.problem.Linear" target="_top" title="A Linear Function with Harmonic Weights:" alt="" coords="573,636,644,661"/> | ||
| <area shape="rect" id="node18" href="../api/ioh.iohcpp.problem.MIS.html#ioh.iohcpp.problem.MIS" target="_top" title="The maximum independent vertex set (MIVS) formulated as " alt="" coords="573,685,644,710"/> | ||
| <area shape="rect" id="node19" href="../api/ioh.iohcpp.problem.NQueens.html#ioh.iohcpp.problem.NQueens" target="_top" title="The N-queens problem (NQP) is defined as the task to place N queens on an N*N chessboard in such a " alt="" coords="568,733,648,758"/> | ||
| <area shape="rect" id="node20" href="../api/ioh.iohcpp.problem.OneMax.html#ioh.iohcpp.problem.OneMax" target="_top" title="OneMax:" alt="" coords="571,782,646,807"/> | ||
| <area shape="rect" id="node21" href="../api/ioh.iohcpp.problem.OneMaxDummy1.html#ioh.iohcpp.problem.OneMaxDummy1" target="_top" title="A variant of OneMax applying the Dummy transformation of W-model. m = 0.5n." alt="" coords="541,831,675,855"/> | ||
| <area shape="rect" id="node22" href="../api/ioh.iohcpp.problem.OneMaxDummy2.html#ioh.iohcpp.problem.OneMaxDummy2" target="_top" title="A variant of OneMax applying the Dummy transformation of W-model. m = 0.9n." alt="" coords="541,879,675,904"/> | ||
| <area shape="rect" id="node23" href="../api/ioh.iohcpp.problem.OneMaxEpistasis.html#ioh.iohcpp.problem.OneMaxEpistasis" target="_top" title="A variant of OneMax applying the Epistasis transformation of W-model. | ||
| u = 4." alt="" coords="542,928,674,953"/> | ||
| <area shape="rect" id="node24" href="../api/ioh.iohcpp.problem.OneMaxNeutrality.html#ioh.iohcpp.problem.OneMaxNeutrality" target="_top" title="A variant of OneMax applying the Neutrality transformation of W-model. mu = 3." alt="" coords="539,976,678,1001"/> | ||
| <area shape="rect" id="node25" href="../api/ioh.iohcpp.problem.OneMaxRuggedness1.html#ioh.iohcpp.problem.OneMaxRuggedness1" target="_top" title="A variant of OneMax applying the first Ruggnedness transformation in https://doi.org/10.1016/j.asoc.2019.106027." alt="" coords="528,1025,688,1050"/> | ||
| <area shape="rect" id="node26" href="../api/ioh.iohcpp.problem.OneMaxRuggedness2.html#ioh.iohcpp.problem.OneMaxRuggedness2" target="_top" title="A variant of OneMax applying the second Ruggnedness transformation in https://doi.org/10.1016/j.asoc.2019.106027." alt="" coords="528,1073,688,1098"/> | ||
| <area shape="rect" id="node27" href="../api/ioh.iohcpp.problem.OneMaxRuggedness3.html#ioh.iohcpp.problem.OneMaxRuggedness3" target="_top" title="A variant of OneMax applying the third Ruggnedness transformation in https://doi.org/10.1016/j.asoc.2019.106027." alt="" coords="528,1122,688,1147"/> | ||
| <area shape="rect" id="node3" href="../api/ioh.iohcpp.problem.IntegerSingleObjective.html#ioh.iohcpp.problem.IntegerSingleObjective" target="_top" title="IntegerSingleObjective" alt="" coords="180,564,348,589"/> | ||
| </map> |
Binary file added
BIN
+10.3 KB
docs/_images/inheritance-e8a3f9627d7da6350025c070a079254c9c717f1c.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
7 changes: 7 additions & 0 deletions
7
docs/_images/inheritance-e8a3f9627d7da6350025c070a079254c9c717f1c.png.map
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,7 @@ | ||
| <map id="inheritance2277b26ca0" name="inheritance2277b26ca0"> | ||
| <area shape="rect" id="node1" href="../api/ioh.iohcpp.problem.IntegerSingleObjective.html#ioh.iohcpp.problem.IntegerSingleObjective" target="_top" title="IntegerSingleObjective" alt="" coords="189,5,359,31"/> | ||
| <area shape="rect" id="node3" href="../api/ioh.iohcpp.problem.IntegerStarDiscrepancy.html#ioh.iohcpp.problem.IntegerStarDiscrepancy" target="_top" title="Star-discrepancy problems" alt="" coords="413,5,588,31"/> | ||
| <area shape="rect" id="node4" href="../api/ioh.iohcpp.problem.RealSingleObjective.html#ioh.iohcpp.problem.RealSingleObjective" target="_top" title="RealSingleObjective" alt="" coords="197,55,351,80"/> | ||
| <area shape="rect" id="node6" href="../api/ioh.iohcpp.problem.StarDiscrepancySampler.html#ioh.iohcpp.problem.StarDiscrepancySampler" target="_top" title="Methods which can be used to sample the initial grids for the star discrepancy problems" alt="" coords="183,104,365,129"/> | ||
| <area shape="rect" id="node5" href="../api/ioh.iohcpp.problem.RealStarDiscrepancy.html#ioh.iohcpp.problem.RealStarDiscrepancy" target="_top" title="Star-discrepancy problems" alt="" coords="422,55,579,80"/> | ||
| </map> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.