ml4co_kit.task
Base classes for all combinatorial optimization tasks in ML4CO-Kit. |
|
Base Task Class for Graph Problems. |
|
Maximum Clique (MCl). |
|
Maximum Cut (MCut). |
|
Maximum Independent Set (MIS). |
|
Minimum Vertex Cover (MVC). |
|
Base task classes for routing problems (TSP, VRP, etc.). |
|
Asymmetric Traveling Salesman Problem (ATSP) |
|
Orienteering Problem (OP). |
|
Prize Collecting Traveling Salesman Problem (PCTSP). |
|
Stochastic Prize Collecting Traveling Salesman Problem (SPCTSP). |
|
Traveling Salesman Problem (TSP). |
|
Capacitated Vehicle Routing Problem (CVRP). |
|
Capacitated Vehicle Routing Problem with Backhauls (CVRPB). |
|
CVRP with backhauls and route length limit (VRPBL). |
|
CVRP with backhauls, length limit and time windows (CVRPBLTW). |
|
CVRP with backhauls and time windows (CVRPBTW). |
|
Capacitated Vehicle Routing Problem with length limit (CVRPL). |
|
CVRP with Length Limit and Time Windows (CVRPLTW). |
|
Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). |
|
Multi-Task VRP (B/MB, O, TW, L) |