## SymMIP.jl: Symmetry analysis for MIPs

** Published:**

Detect the formulation symmetry group of a MILP model, and display the orbits and the generators of this group. Github

** Published:**

Detect the formulation symmetry group of a MILP model, and display the orbits and the generators of this group. Github

** Published:**

A simple julia wrapper for traces. Github

** Published:**

Binpacking is an important combinatorial problem in operations research. Conic submodular binpacking generalizes the classical binpacking problem to nonlinear setting, and it can formulate the chance-constrained binpacking, the distributionally robust binpacking etc. cbp implements several branch-and-price algorithms to solve the conic submodular binpacking problems. Github

** Published:**

Facility location is an important appication in operations research. Continuous set covering on networks generalizes the classical dicrete set covering problems in graphs, which allows both the demands and facilities continuously locating in edges. cflg contains several algorithms for solving continuous set covering on networks. cflg is written in Julia based on JuMP. Github

** Published:**

wUMCFC is a specialized branch-and-price (BP) based solver for unsplittable multi-commodity flow routing with network coding. Unsplittable multi-commodity flow is a fundamentel problem in network optimization. wUMCFC uses network coding to decrease the routing cost and increase the capacity usage for wireless networks. Github