Task Development Status
✔: Supported; 📆: Planned for future versions (contributions welcomed!).
Task |
Definition |
Check Constraint |
Evaluation |
Render |
Special R/O |
|---|---|---|---|---|---|
Asymmetric TSP (ATSP) |
✔ |
✔ |
✔ |
📆 |
|
Orienteering Problem (OP) |
✔ |
✔ |
✔ |
📆 |
|
Prize Collection TSP (PCTSP) |
✔ |
✔ |
✔ |
📆 |
|
Stochastic PCTSP (SPCTSP) |
✔ |
✔ |
✔ |
📆 |
|
Traveling Salesman Problem (TSP) |
✔ |
✔ |
✔ |
✔ |
|
Capacitated Vehicle Routing Problem (CVRP) |
✔ |
✔ |
✔ |
✔ |
|
CVRP with Backhauls (CVRPB) |
✔ |
✔ |
✔ |
📆 |
|
CVRP with Backhauls and Length Limit (CVRPBL) |
✔ |
✔ |
✔ |
📆 |
|
CVRP with Backhauls, Length Limit and TW (CVRPBLTW) |
✔ |
✔ |
✔ |
📆 |
|
CVRP with Backhauls and Time Windows (CVRPBTW) |
✔ |
✔ |
✔ |
📆 |
|
CVRP with Length Limit (CVRPL) |
✔ |
✔ |
✔ |
📆 |
|
CVRP with Length Limit and Time Windows (CVRPLTW) |
✔ |
✔ |
✔ |
📆 |
|
CVRP with Time Windows (CVRPTW) |
✔ |
✔ |
✔ |
📆 |
|
Maximum Clique (MCl) |
✔ |
✔ |
✔ |
✔ |
|
Maximum Cut (MCut) |
✔ |
✔ |
✔ |
✔ |
|
Maximum Independent Set (MIS) |
✔ |
✔ |
✔ |
✔ |
|
Minimum Vertex Cover (MVC) |
✔ |
✔ |
✔ |
✔ |
|
Graph Matching (GM) |
✔ |
✔ |
✔ |
📆 |
|
Graph Edit Distance (GED) |
✔ |
✔ |
✔ |
📆 |
|
Koopmans-Beckmann QAP (KQAP) |
✔ |
✔ |
✔ |
📆 |
|
Satisfiability Prediction (SATP) |
✔ |
✔ |
✔ |
📆 |
|
Satisfying Assignment Prediction (SATA) |
✔ |
✔ |
✔ |
📆 |
|
Maximum Return Portfolio Optimization (MaxRetPO) |
✔ |
✔ |
✔ |
📆 |
|
Minimum Variance Portfolio Optimization (MinVarPO) |
✔ |
✔ |
✔ |
📆 |
|
Multi-Objective Portfolio Optimization (MOPO) |
✔ |
✔ |
✔ |
📆 |
|
EDA Placement (EDAP) |
✔ |
✔ |
✔ |
📆 |
|