27 datasets found

Filter Results

  • Flexible Job-Shop Scheduling Problem

    The Flexible Job-Shop Scheduling Problem (FJSSP) is a combinatorial optimization problem where the goal is to find the optimal schedule for a set of jobs on a set of machines.

  • Vehicle Routing Problem

    The Vehicle Routing Problem (VRP) is a classic problem in combinatorial optimization. The problem is to find the shortest route that visits each node in a graph exactly once and...

  • CVRP

    The CVRP dataset is a set of instances of the Capacitated Vehicle Routing Problem, a classic problem in Operations Research. The dataset is used to test the performance of...

  • HIFF Function

    The dataset used in the paper is a collection of combinatorial optimization problems, including concatenated deceptive traps, NK landscapes, and the HIFF function.

  • NK Landscapes

    The dataset used in the paper is a collection of combinatorial optimization problems, including concatenated deceptive traps, NK landscapes, and the HIFF function.

  • Concatenated Deceptive Traps

    The dataset used in the paper is a collection of combinatorial optimization problems, including concatenated deceptive traps, NK landscapes, and the HIFF function.

  • SC, MIS, CA, and MC datasets

    The dataset used in this paper is a collection of four NP-hard benchmark problems: Set Covering (SC), Maximal Independent Set (MIS), Combinatorial Auction (CA), and Maximum Cut...