I found a implementation for solving LAP problem by torch on github, but it is not quiet usable.

  
      github.com
  
  
    bkj/auction-lap/blob/master/auction_lap.py 190
#!/usr/bin/env python

"""
    auction_lap.py
    
    From
        https://dspace.mit.edu/bitstream/handle/1721.1/3265/P-2108-26912652.pdf;sequence=1
"""

from __future__ import print_function, division

import sys
import torch

def auction_lap(X, eps=None, compute_score=True):
    """
        X: n-by-n matrix w/ integer entries
        eps: "bid size" -- smaller values means higher accuracy w/ longer runtime
    """
    eps = 1 / X.shape[0] if eps is None else eps


  This file has been truncated. show original

  
  
    
    
  
  


I would really appreciate it if someone would share a robust implementation for LAP problem