[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["This documentation provides a reference for C++ algorithms related to optimization."],["The algorithms cover various areas such as data structures (dense_doubly_linked_list, sparse_permutation), problem-solving (knapsack_solver, hungarian), and graph manipulation (find_graph_symmetries, dynamic_partition)."],["Libraries like dynamic_permutation and knapsack_solver_for_cuts are also included for specialized optimization tasks."],["Each algorithm is linked to its detailed documentation for further exploration and usage."]]],["The content lists C++ algorithms within the `optimization` namespace, detailing several libraries. These libraries include `dense_doubly_linked_list`, `dynamic_partition`, `dynamic_permutation`, `find_graph_symmetries`, `hungarian`, `knapsack_solver`, `knapsack_solver_for_cuts`, and `sparse_permutation`. Each library represents a different algorithm, with links to their respective documentation. The documentation is auto-generated and presented in a tabular format, organized by library name and link.\n"]]
