This project aims to maximize path length in a grid by fitting pentominoes and selecting start and end positions, always choosing the shortest path. Three approaches have been explored so far: brute force, pathfinding algorithms, and MILP-based optimization.
Mixed-Integer Linear Programming (MILP) with CPLEX solver to optimize server fleet management.
Combinatorial optimization project for the Multiple Couriers Problem (MCP).
Assign workers to tasks for the duration of their shift while meeting a range of fixed and variable constraints. A resource allocation problem.
Add a description, image, and links to the milp-optimisation topic page so that developers can more easily learn about it.
To associate your repository with the milp-optimisation topic, visit your repo's landing page and select "manage topics."