• 🏡 HOME
  • about
  • research/engineering
  • math
  • music

logic

  • A turan graph and the inequality ILP constraints for a k-partite matching problem.

    Solving Hard Combinatorial Problems with Predicate ILP Constraints

    Leveraging the power of Integer Linear Programs

    APR 2, 2021
    categories: EXPLORATIONS
    tags: CONVEX OPTIMIZATION, GRAPHS, LINEAR PROGRAMMING, LOGIC, MACHINE LEARNING


© aferro