Skip to content

phabe.ch

yet another source of inspiration…

  • contact

Tag: constraint programming

A MILP based Happy Cube©® Solver

Posted on 31. August 202415. September 2024 by Fabian Leuthold

In this post, we’re developing a Happy Cube solver using a mixed integer linear program (MILP). Previously, we tackled this problem on a micro:bit using dynamic programming and backtracking. Now, we’re trying a different approach by creating a mathematical model to solve this combinatorial challenge. The idea is to structure the MILP so that it… Read more A MILP based Happy Cube©® Solver

Graph Coloring Problem

Posted on 10. September 202211. September 2022 by Fabian Leuthold

A node coloring is valid or admissible if any two adjacent nodes do not have the same color. If a graph is colorable, there is a smallest number such that the graph is node colorable. This number is called the chromatic number of the graph and is usually denoted by . The problem to identify… Read more Graph Coloring Problem

Skip to footer

what you can find here

posts on operations research, programming, tinkering, languages, health, society and more…

Categories

  • arduino
  • common
  • fun
  • heuristics & algorithms
  • micro:bit
  • music
  • optimization
  • poems
  • programming
  • raspberry pi
  • tinkering
  • tools

Recent Posts

  • A MILP based Happy Cube©® Solver
  • How to Construct Solutions to the Production Planning Problem
  • Solving TSPs to Optimality with Integer Linear Programming in Python
  • How to Improve TSP-Tours Applying the 2-opt Neighborhood
  • How to construct Solutions to the Bin Packing Problem
Proudly powered by WordPress | Theme: Yocto by Humble Themes.