Learn | Jij documentation

Binary Linear Programming

In this section we will show you how to model binary linear programming.

Knapsack Problem

Here we show how to solve the knapsack problem using JijZept and JijModeling.

Traveling Salesman Problem

The Travelling Salesman Problem (TSP) is the problem of finding the shortest tour salesman to visit every city.

The K-Median Problem

The k-median problem is the problem of clustering data points into k clusters, aiming to minimize the sum of distances...

Multi-Car Paint Shop Problem

In this tutorial, we will solve the Multi-Car Paint Shop (MCPS) problem using JijZept, based on the work of Sheir Yarkoni,...

Number Partitioning

Here we show how to solve the number partitioning problem using JijZept and JijModeling.

Shift Optimization Problem

The shift optimization problem is the problem of finding the optimal cost under several constraints.

Graph Coloring Problem

Here we show how to solve graph coloring problems using JijZept and JijModeling.

Clique Cover Problem

Here we show how to solve clique cover problems using JijZept and JijModeling.

Job Sequencing Problem with Integer Lengths

Here we show how to solve job sequencing problems with integer lengths using JijZept and JijModeling.

Graph Partitioning

Here we show how to solve the graph partitioning problem using JijZept and JijModeling.

Clique Problem

Here we show how to solve clique problem using JijZept and JijModeling.

Exact Cover

Here we show how to solve exact cover problem using JijZept and JijModeling.

Set Packing

Here we show how to solve set packing problem using JijZept and JijModeling.

Vertex Cover Problem

Here we show how to solve vertex cover problem using JijZept and JijModeling.

Minimum Maximal Matching

Here we show how to solve minimum maximal matching problem using JijZept and JijModeling.

Set Cover

Here we show how to solve the set cover problem using JijZept and JijModeling.

Hamiltonian Cycles and Paths

Here we show how to solve Hamiltonian cycles and paths problem using JijZept and JijModeling.

Minimum Spanning Tree with a Maximum Degree Constraint

Here we show how to solve minimum spanning tree problem with maximum degree constraint using JijZept and JijModeling.

Directed Feedback Vertex Set problem

Here we show how to solve directed feedback vertex set problem using JijZept and JijModeling.

Graph Isomorphisms problem

Here we show how to solve graph isomorphisms problem using JijZept and JijModeling.

An optimization for preventing a pandemic on a university campus

Here we show how to solve the Max-Cut problem introduced by [Sud & Li (2021)] using JijZept and JijModeling.

Dynamic Asset Allocation with Expected Shortfall

Here we show how to solve the portfolio optimization with a measure of expected shortfall risk using JijZept.

Item Listing Optimization for E-Commerce Websites Based on Diversity

Here we show how to solve the item listing optimization for E-Commerce using JijZept.

Deep Space Network Scheduling

Here we show how to solve the Deep Space Network scheduling problem introduced by [Guillaume et al. (2022)] using JijZept.

Data Loader for MPS format files

JijModeling can read mathematical models and their instances defined in MPS files.