opt

module
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

README

opt

Discrete Optimization package written in Go

Problems

allocation
  • resource - Resource Allocation
  • scene - Scene Allocation
  • fair_item - Fair Item Allocation
  • house - House Allocation
assignment
  • basic - Assignment
  • bottleneck - Bottleneck Assignment
  • general - Generalized Assignment
  • quadratic - Quadratic Assignment
  • quadratic_bottleneck - Quadratic Bottleneck Assignment
  • weapon - Weapon Target Assignment
bin_cover
  • basic - Bin Cover
bin_packing
  • basic - Bin Packing
car_painting
  • basic - Car Painting
  • binary - Binary Paint Shop
car_sequencing
  • basic - Car Sequencing
clique
  • basic - Clique
  • k - K-Clique
clique_cover
  • basic - Clique Cover
dominating_set
  • basic - Dominating Set
  • edge - Edge Dominating Set
  • efficient - Efficient Dominating Set
edge_coloring
  • basic - Edge Coloring
edge_cover
  • basic - Edge Cover
flow_shop
  • basic - Flow Shop Scheduling
graph_matching
  • cardinal - Max Cardinality Matching
  • weighted - Max Weight Matching
  • rainbow - Rainbow Matching
graph_partition
  • basic - Graph Partition
graph_path
  • longest - Longest Path
  • minimax - Minimax Path
  • shortest - Shortest Path
  • widest - Widest Path
graph_tour
  • euler_path - Eulerian Path
  • euler_cycle - Eulerian Cycle
  • hamilton_path - Hamiltonian Path
  • hamilton_cycle - Hamiltonian Cycle
independent_set
  • basic - Independent Set
  • rainbow - Rainbow Independent Set
  • weighted - Weighted Independent Set
induced_path
  • basic - Max Induced Path
interval
  • basic - Activity Selection
  • weighted - Weighted Activity Selection
k_center
  • basic - K-Center
k_cut
  • min - Min K-Cut
  • max - Max K-Cut
knapsack
  • basic - 0-1 Knapsack
  • quadratic - Quadratic Knapsack
max_coverage
  • basic - Max Coverage
number_coloring
  • sum - Sum Coloring
number_partition
  • basic - Number Partition
nurse_scheduling
  • basic - Nurse Scheduling
satisfaction
  • exact_cover - Exact Cover
  • langford - Langford Pair
  • magic_series - Magic Series
  • n_queens - N-Queens
  • topological_sort - Topological Sort
set_cover
  • basic - Set Cover
  • weighted - Weighted Set Cover
set_packing
  • basic - Set Packing
  • weighted - Weighted Set Packing
set_splitting
  • basic - Set Splitting
  • weighted - Weighted Set Splitting
spanning_tree
  • mst - Minimum Spanning Tree
  • mdst - Min-Degree Spanning Tree
  • kmst - K-Minimum Spanning Tree
steiner_tree
  • basic - Steiner Tree
subsequence
  • increasing - Longest Increasing Subsequence
  • alternating - Longest Alternating Subsequence
  • decreasing - Longest Decreasing Subsequence
  • max_sum_increasing - Max Sum Increasing Subseqeuence
  • max_weight_increasing - Max Weight Increasing Subsequence
subset_sum
  • basic - Subset Sum
traveling_purchaser
  • basic - Traveling Purchaser
traveling_salesman
  • basic - Traveling Salesman
  • bottleneck - Bottleneck Traveling Salesman
vertex_coloring
  • basic - Vertex Coloring
  • complete - Complete Coloring
  • harmonious - Harmonious Coloring
vertex_cover
  • basic - Vertex Cover
warehouse_location
  • basic - Warehouse Location
  • minimax - Minimax Warehouse Location
  • maxmin - MaxMin Warehouse Location

Directories

Path Synopsis
Package data contains functions for loading problem test cases
Package data contains functions for loading problem test cases
Package discrete contains the common parts of discrete optimization problems
Package discrete contains the common parts of discrete optimization problems

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL