Contents Menu Expand Light mode Dark mode Auto light/dark, in light mode Auto light/dark, in dark mode Skip to content
Asunder documentation
Logo
Asunder documentation

Getting Started

  • Getting Started
    • Introduction
    • Installation
    • Quickstart Guide

Learn

  • Learn
    • Tutorials
      • CPCONG Tutorial
    • Guides
      • Problem Fit and Utility

API

  • API Reference
    • Top-Level API
    • Base API
      • Algorithms
        • Reduced Cost Community Search
        • Community Algorithms
        • Core-Periphery Algorithms
        • Modified Louvain
        • Very Fortunate Descent
        • Spectral Algorithms
      • Branch And Price
        • Branching Tree
        • Symmetry Detection
      • Column Generation
        • Decomposition
        • Master Problem
        • Subproblem
      • Evaluation
        • Metrics
      • Utils
        • Graph Utilities
        • Partition Generation
      • Visualization
        • Graph Visualization
    • Load Balancing API
      • Load Balancing Column Generation
        • Load Balancer
        • Load Balancing Master Problem
      • Load Balancing Algorithms
        • Load Balancing Refinement
      • Load Balancing Utilities
        • Load Balancing Partition Generation
    • NLBNP API
      • Generic NLBNP Workflow
      • NLBNP Algorithms
        • Refinement
      • NLBNP Case Studies
        • Circle Cutting
        • CPCONG
        • Runner

Reference

  • Reference
    • Development Guide
      • Design Principles
      • Contributing to Asunder
      • Special Topics
      • Making Asunder Releases
    • How to Cite Asunder
    • References
    • License
    • Credits
Back to top
View this page

GuidesΒΆ

  • Problem Fit and Utility
Next
Problem Fit and Utility
Previous
CPCONG Tutorial
Copyright ©
Made with Sphinx and @pradyunsg's Furo