problem

package
v0.0.0-...-33b5a50 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Feb 28, 2026 License: MIT Imports: 14 Imported by: 0

Documentation

Index

Constants

View Source 
const (
	Allocation         = "allocation"
	Assignment         = "assignment"
	BinCover           = "bin_cover"
	BinPacking         = "bin_packing"
	CarPainting        = "car_painting"
	CarSequencing      = "car_sequencing"
	Clique             = "clique"
	CliqueCover        = "clique_cover"
	DominatingSet      = "dominating_set"
	EdgeColoring       = "edge_coloring"
	EdgeCover          = "edge_cover"
	FlowShopScheduling = "flow_shop"
	GraphMatching      = "graph_matching"
	GraphPartition     = "graph_partition"
	GraphPath          = "graph_path"
	GraphTour          = "graph_tour"
	IndependentSet     = "independent_set"
	InducedPath        = "induced_path"
	Interval           = "interval"
	KCenter            = "k_center"
	KCut               = "k_cut"
	Knapsack           = "knapsack"
	MaxCoverage        = "max_coverage"
	NumberColoring     = "number_coloring"
	NumberPartition    = "number_partition"
	NurseScheduling    = "nurse_scheduling"
	Satisfaction       = "satisfaction"
	SetCover           = "set_cover"
	SetPacking         = "set_packing"
	SetSplitting       = "set_splitting"
	SpanningTree       = "spanning_tree"
	SteinerTree        = "steiner_tree"
	Subsequence        = "subsequence"
	SubsetSum          = "subset_sum"
	TravelingPurchaser = "traveling_purchaser"
	TravelingSalesman  = "traveling_salesman"
	VertexColoring     = "verttex_coloring"
	VertexCover        = "vertex_cover"
	WarehouseLocation  = "warehouse_location"
)

Variables

View Source 
var Creator = map[string]func(string, int) *discrete.Problem{
	Allocation:         NewAllocation,
	Assignment:         NewAssignment,
	BinCover:           NewBinCover,
	BinPacking:         NewBinPacking,
	CarPainting:        NewCarPainting,
	CarSequencing:      NewCarSequencing,
	Clique:             NewClique,
	CliqueCover:        NewCliqueCover,
	DominatingSet:      NewDominatingSet,
	EdgeColoring:       NewEdgeColoring,
	EdgeCover:          NewEdgeCover,
	FlowShopScheduling: NewFlowShopScheduling,
	GraphMatching:      NewGraphMatching,
	GraphPartition:     NewGraphPartition,
	GraphPath:          NewGraphPath,
	GraphTour:          NewGraphTour,
	IndependentSet:     NewIndependentSet,
	InducedPath:        NewInducedPath,
	Interval:           NewInterval,
	KCenter:            NewKCenter,
	KCut:               NewKCut,
	Knapsack:           NewKnapsack,
	MaxCoverage:        NewMaxCoverage,
	NumberColoring:     NewNumberColoring,
	NumberPartition:    NewNumberPartition,
	NurseScheduling:    NewNurseScheduling,
	Satisfaction:       NewSatisfaction,
	SetCover:           NewSetCover,
	SetPacking:         NewSetPacking,
	SetSplitting:       NewSetSplitting,
	SpanningTree:       NewSpanningTree,
	SteinerTree:        NewSteinerTree,
	Subsequence:        NewSubsequence,
	SubsetSum:          NewSubsetSum,
	TravelingPurchaser: NewTravelingPurchaser,
	TravelingSalesman:  NewTravelingSalesman,
	VertexColoring:     NewVertexColoring,
	VertexCover:        NewVertexCover,
	WarehouseLocation:  NewWarehouseLocation,
}

Functions

func NewAllocation 

func NewAllocation(variant string, n int) *discrete.Problem

NewAllocation creates a new Allocation problem

func NewAssignment 

func NewAssignment(variant string, n int) *discrete.Problem

NewAssignment creates a new Assignment problem

func NewBinCover 

func NewBinCover(variant string, n int) *discrete.Problem

NewBinCover creates a new Bin Cover problem

func NewBinPacking 

func NewBinPacking(variant string, n int) *discrete.Problem

NewBinPacking creates a new Bin Packing problem

func NewCarPainting 

func NewCarPainting(variant string, n int) *discrete.Problem

NewCarPainting creates a new Car Paiting problem

func NewCarSequencing 

func NewCarSequencing(variant string, n int) *discrete.Problem

NewCarSequencing creates a new Car Sequencing problem

func NewClique 

func NewClique(variant string, n int) *discrete.Problem

NewClique creates a new Clique problem

func NewCliqueCover 

func NewCliqueCover(variant string, n int) *discrete.Problem

NewCliqueCover creates a new Clique Cover problem

func NewDominatingSet 

func NewDominatingSet(variant string, n int) *discrete.Problem

NewDominatingSet creates a new Dominating Set problem

func NewEdgeColoring 

func NewEdgeColoring(variant string, n int) *discrete.Problem

NewEdgeColoring creates a new Edge Coloring problem

func NewEdgeCover 

func NewEdgeCover(variant string, n int) *discrete.Problem

NewEdgeCover creates a new Edge Cover problem

func NewFlowShopScheduling 

func NewFlowShopScheduling(variant string, n int) *discrete.Problem

NewFlowShopScheduling creates a new Flow Shop Scheduling problem

func NewGraphMatching 

func NewGraphMatching(variant string, n int) *discrete.Problem

NewGraphMatching creates a new Graph Matching problem

func NewGraphPartition 

func NewGraphPartition(variant string, n int) *discrete.Problem

NewGraphPartition creates a new Graph Partition problem

func NewGraphPath 

func NewGraphPath(variant string, n int) *discrete.Problem

NewGraphPath creates a new Graph Path problem

func NewGraphTour 

func NewGraphTour(variant string, n int) *discrete.Problem

NewGraphTour creates a new Graph Tour problem

func NewIndependentSet 

func NewIndependentSet(variant string, n int) *discrete.Problem

NewIndependentSet creates a new Independent Set problem

func NewInducedPath 

func NewInducedPath(variant string, n int) *discrete.Problem

NewInducedPath creates a new Induced Path problem

func NewInterval 

func NewInterval(variant string, n int) *discrete.Problem

NewInterval creates a new Interval problem

func NewKCenter 

func NewKCenter(variant string, n int) *discrete.Problem

NewKCenter creates a new K-Center problem

func NewKCut 

func NewKCut(variant string, n int) *discrete.Problem

NewKCut creates a new K-Cut problem

func NewKnapsack 

func NewKnapsack(variant string, n int) *discrete.Problem

NewKnapsack creates a new Knapsack problem

func NewMaxCoverage 

func NewMaxCoverage(variant string, n int) *discrete.Problem

NewMaxCoverage creates a new Max Coverage problem

func NewNumberColoring 

func NewNumberColoring(variant string, n int) *discrete.Problem

NewNumberColoring creates a new Vertex Coloring problem that uses numbers as colors

func NewNumberPartition 

func NewNumberPartition(variant string, n int) *discrete.Problem

NewNumberPartition creates a new Number Partition problem

func NewNurseScheduling 

func NewNurseScheduling(variant string, n int) *discrete.Problem

NewNurseScheduling creates a new Nurse Scheduling problem

func NewSatisfaction 

func NewSatisfaction(variant string, n int) *discrete.Problem

NewSatisfaction creates a new Satisfaction problem

func NewSetCover 

func NewSetCover(variant string, n int) *discrete.Problem

NewSetCover creates a new Set Cover problem

func NewSetPacking 

func NewSetPacking(variant string, n int) *discrete.Problem

NewSetPacking creates a new Set Cover problem

func NewSetSplitting 

func NewSetSplitting(variant string, n int) *discrete.Problem

NewSetSplitting creates a new Set Cover problem

func NewSpanningTree 

func NewSpanningTree(variant string, n int) *discrete.Problem

NewSpanningTree creates a new Spanning Tree problem

func NewSteinerTree 

func NewSteinerTree(variant string, n int) *discrete.Problem

NewSteinerTree creates a new Steiner Tree problem

func NewSubsequence 

func NewSubsequence(variant string, n int) *discrete.Problem

NewSubsequence creates a new Subsequence problem

func NewSubsetSum 

func NewSubsetSum(variant string, n int) *discrete.Problem

NewSubsetSum creates a new Subset Sum problem

func NewTravelingPurchaser 

func NewTravelingPurchaser(variant string, n int) *discrete.Problem

NewTravelingPurchaser creates a new Traveling Purchaser problem

func NewTravelingSalesman 

func NewTravelingSalesman(variant string, n int) *discrete.Problem

NewTravelingSalesman creates a new Traveling Salesman problem

func NewVertexColoring 

func NewVertexColoring(variant string, n int) *discrete.Problem

NewVertexColoring creates a new Vertex Coloring problem

func NewVertexCover 

func NewVertexCover(variant string, n int) *discrete.Problem

NewVertexCover creates a new Vertex Cover problem

func NewWarehouseLocation 

func NewWarehouseLocation(variant string, n int) *discrete.Problem

NewWarehouseLocation creates a new Warehouse Location problem

Types

This section is empty.

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.