sunegadegaard Goto Github PK

biobjectivebranchandcut

Contains code for a bi objective branch and cut algorithm which can be used for bi objective combinatorial optimization in minimization form.

bocblp

This repository contains codes, instances and results for the bi-objective cost bottleneck location problem. The code is written in C++

dinnerwithfriends

Implements a constraint programming model in orTools for creating "play groups" in the setting of "Dinner with your friends"

election

Project focusing on using mathematical programming for allocation paliament seats in an optimal way in a representative system

greenvehiclerouting

instances

In this repository, problem instances for various optimization problems can be found

kandidattest2019

mifpa

Includes Python code used in the course "Modellering inden for Prescriptive Analytics" run at Aarhus University, Departement of Economics and Business Economics

moreporesult

Writer that uses jsoncpp to write results of a multi objective optimization problem to a .json formattet file which is consistent with the MOrepo format.

resultconverter

Code for converting results from bi-objective programs to the MOrepo format

sscflp_instances

Instances used for the SSCFLP solver.

sscflpgenerator

Code for generating instances of the single source capacitated facility location problem

sscflpsolver

A solver for the single source capacitated facility location problem.

sunegadegaard.github.io

Educational webpage

twophasemethod