qlauncher.problems.optimization

Submodules:

• 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:

• qlauncher.problems.optimization.jssp_utils

Summary

__all__ Classes:

EC	Class for exact cover problem.
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.
JSSP	Class for Job Shop Scheduling Problem.
Knapsack	Class for 0/1 Knapsack Problem.
MaxCut	Class for MaxCut Problem.
QATM	Abstract class for defining Problems.
TSP	Traveling Salesman Problem (TSP) definition.
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.