https://github.com/sandyspiers/coordinatepartitioning.jl

An exact algorithm for difficulty and high coordinate Euclidean diversity problems
https://github.com/sandyspiers/coordinatepartitioning.jl

julia optimisation-algorithms quadratic-programming

Last synced: about 2 months ago
JSON representation

An exact algorithm for difficulty and high coordinate Euclidean diversity problems

• Host: GitHub
• URL: https://github.com/sandyspiers/coordinatepartitioning.jl
• Owner: sandyspiers
• License: mit
• Created: 2024-07-05T07:21:50.000Z (6 months ago)
• Default Branch: main
• Last Pushed: 2024-09-05T07:20:13.000Z (4 months ago)
• Last Synced: 2024-10-13T22:24:08.276Z (3 months ago)
• Topics: julia, optimisation-algorithms, quadratic-programming
• Language: Julia
• Homepage:
• Size: 49.8 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# CoordinatePartitioning

[![Build Status](https://github.com/sandyspiers/CoordinatePartitioning.jl/actions/workflows/CI.yml/badge.svg?branch=main)](https://github.com/sandyspiers/CoordinatePartitioning.jl/actions/workflows/CI.yml?query=branch%3Amain)

[![Aqua](https://raw.githubusercontent.com/JuliaTesting/Aqua.jl/master/badge.svg)](https://github.com/JuliaTesting/Aqua.jl)

This is a Julia rebasing of the code for [our cutting plane method for difficulty and high coordinate Euclidean max-sum diversity problems](https://github.com/sandyspiers/coordinate_partitioning).