• NuMVC

  • Referenced in 12 articles [sw08219]
  • problem is a prominent NP-hard combinatorial optimization problem of great importance in both theory...
  • SIMPL

  • Referenced in 11 articles [sw13333]
  • SIMPL: A system for integrating optimization techniques. In recent years, the Constraint Programming ... techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile modeling...
  • MD-jeep

  • Referenced in 11 articles [sw09842]
  • reformulate this problem as a combinatorial optimization problem, and describe a branch and prune solution...
  • RAMP

  • Referenced in 10 articles [sw02493]
  • RAMP: a new metaheuristic framework for combinatorial optimization We propose a new metaheuristic framework embodied...
  • 2L_enum

  • Referenced in 9 articles [sw31753]
  • polytopes is motivated by questions in combinatorial optimization and communication complexity, among others. In this ... present the first algorithm for enumerating all combinatorial types of 2-level polytopes...
  • CHUFFED

  • Referenced in 9 articles [sw24724]
  • lazy clause generation solver chuffed: Improving combinatorial optimization. PhD thesis, Engineering, Computer Science and Software...
  • OR-tools

  • Referenced in 9 articles [sw14807]
  • tools, Google’s software suite for combinatorial optimization. The suite contains: A constraint programming solver...
  • CABOB

  • Referenced in 31 articles [sw17813]
  • CABOB: a fast optimal algorithm for winner determination in combinatorial auctions. Combinatorial auctions where bidders ... inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition...
  • BOB

  • Referenced in 6 articles [sw21601]
  • allowing on the one hand the Combinatorial Optimization community to implement their applications without worrying ... composed by the efficient algorithms of Combinatorial Optimization for its parallelization methods and/or tools...
  • BiqCrunch

  • Referenced in 8 articles [sw23686]
  • method that uses an original, efficient semidefinite-optimization-based bounding procedure. It has been successfully ... variety of well-known combinatorial optimization problems, such as Max-Cut, Max-k-Cluster...
  • BPPLIB

  • Referenced in 8 articles [sw23883]
  • among the most intensively studied combinatorial optimization problems. We present a library of computer codes...
  • ALE-PSO

  • Referenced in 7 articles [sw38756]
  • global optimum of a hard combinatorial optimization problem, such those encountered in global optimization problems...
  • NILS

  • Referenced in 7 articles [sw20669]
  • solutions from the search space. Many combinatorial optimization problems share this property, that is generally...
  • TSPAntSim

  • Referenced in 6 articles [sw04980]
  • extensively studied combinatorial optimization problems and tries to find the shortest route for salesperson which...
  • HuGS

  • Referenced in 6 articles [sw10598]
  • HuGS) project, an effort to investigate interactive optimization. HuGS provides simple and general visual metaphors ... wide variety of problems and combinatorial optimization algorithms, which we demonstrate by describing the HuGS...
  • simPop

  • Referenced in 6 articles [sw23153]
  • into three main groups: synthetic reconstruction, combinatorial optimization, and model-based generation. We provide...
  • RobinX

  • Referenced in 6 articles [sw31870]
  • sports timetabling. Sports timetabling problems are combinatorial optimization problems which consist of creating a timetable...
  • COMBAT

  • Referenced in 4 articles [sw03242]
  • Multi-objective combinatorial optimization for selecting best available techniques (BAT) in the industrial sector ... optimal solution. The generation of the Pareto optimal solutions is performed using an improved version ... known drawbacks. The COMBAT tool (combinatorial optimization with multiple criteria for BAT selection) that...
  • EOlib

  • Referenced in 19 articles [sw00239]
  • kind of hard optimization problems, from continuous to combinatorial ones...
  • WPM2

  • Referenced in 5 articles [sw19790]
  • Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into WPMS. In this paper...