Struct ScoreBasedRoutingSolver 

pub struct ScoreBasedRoutingSolver;

Scoring-based assignment solver for lead routing

Algorithm:

1. Sort leads by priority (higher priority first) and score (higher first)
2. For each lead, calculate fit scores with all available reps
3. Filter reps by territory requirement if configured
4. Assign lead to best-scoring rep with available capacity
5. Update rep loads and continue

Implementations

impl ScoreBasedRoutingSolver

pub fn solve_routing( &self, input: &LeadRoutingInput, spec: &ProblemSpec, ) -> Result<(LeadRoutingOutput, SolverReport)>

Solve the lead routing problem

Trait Implementations

impl PackSolver for ScoreBasedRoutingSolver

fn id(&self) -> &'static str

Solver identifier (e.g., “greedy-v1”)

fn solve(&self, spec: &ProblemSpec) -> Result<(Value, SolverReport)>

Solve and produce plan payload + report

fn is_exact(&self) -> bool

Whether this solver guarantees optimality