https://github.com/sandyspiers/coordinate_partitioning

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

optimisation-algorithms paper quadratic-programming

Last synced: 24 days ago
JSON representation

An exact algorithm for difficulty and high coordinate Euclidean diversity problems

• Host: GitHub
• URL: https://github.com/sandyspiers/coordinate_partitioning
• Owner: sandyspiers
• License: mit
• Created: 2023-09-11T07:18:03.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-09-05T06:53:26.000Z (4 months ago)
• Last Synced: 2024-09-07T09:09:08.349Z (4 months ago)
• Topics: optimisation-algorithms, paper, quadratic-programming
• Language: Jupyter Notebook
• Homepage:
• Size: 6.4 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Coordinate Partitioning for Difficult Euclidean Max-Sum Diversity Problems

This repo contains a new exact method to solve difficult and high-coordinate Euclidean max-sum diversity problems.

It is associated with [1], and comes as a result of our work in [2].

## Dependencies

* `Cplex 22.1.1`

* `Eigen 3.4.0`

## Reproducibility

To reproduce the results in [1], update `CMakeLists.txt` to include corrected filepaths for `Cplex` and `Eigen` libraries and run

```bash

mkdir build

cd build

cmake ..

make .

```

Then to run the experiments in the background, run

```bash

nohup ./build/coordinate_partitioning &

```

## References

[1] Spiers, S., Bui, H. T., & Loxton, R. (2023). Coordinate Partitioning for Difficult Euclidean Max-Sum Diversity Problems. *Manuscript under review*.

[2] [Spiers, S., Bui, H. T., & Loxton, R. (2023). An exact cutting plane method for the Euclidean max-sum diversity problem. *European Journal of Operational Research*.](https://www.sciencedirect.com/science/article/pii/S037722172300379X).