:autogenerated:

qlauncher.problems.optimization
=======================================

.. automodule:: qlauncher.problems.optimization
    


    Submodules:

    .. toctree::
       :maxdepth: 1

       qlauncher.problems.optimization.ec
       qlauncher.problems.optimization.graph_coloring
       qlauncher.problems.optimization.jssp
       qlauncher.problems.optimization.knapsack
       qlauncher.problems.optimization.maxcut
       qlauncher.problems.optimization.qatm
       qlauncher.problems.optimization.tsp
       qlauncher.problems.optimization.vertex_cover
    Subpackages:

    .. toctree::
       :maxdepth: 1

       qlauncher.problems.optimization.jssp_utils



    Summary
    -------

    ``__all__`` Classes:


    .. list-table::
    
       * - :class:`EC <qlauncher.problems.optimization.ec.EC>`
         - Class for exact cover problem.
       * - :class:`GraphColoring <qlauncher.problems.optimization.graph_coloring.GraphColoring>`
         - Class for Graph Coloring Problem which is a combinatorial problem involving assigning labels to vertices of the graph such that no two adjacent vertices share the same label.
       * - :class:`JSSP <qlauncher.problems.optimization.jssp.JSSP>`
         - Class for Job Shop Scheduling Problem.
       * - :class:`Knapsack <qlauncher.problems.optimization.knapsack.Knapsack>`
         - Class for 0/1 Knapsack Problem.
       * - :class:`MaxCut <qlauncher.problems.optimization.maxcut.MaxCut>`
         - Class for MaxCut Problem.
       * - :class:`QATM <qlauncher.problems.optimization.qatm.QATM>`
         - Abstract class for defining Problems.
       * - :class:`TSP <qlauncher.problems.optimization.tsp.TSP>`
         - Traveling Salesman Problem (TSP) definition.
       * - :class:`VertexCover <qlauncher.problems.optimization.vertex_cover.VertexCover>`
         - Class for the Vertex Cover problem which is a combinatorial problem involving choosing a subset of graph vertices such that each edge of the graph has at least one vertex in the chosen subset.