Modelling and solving combinatorial optimization problems with Branch-and-Cut algorithms

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.advisorLahdelma, Risto
dc.contributor.authorMäntysaari, Juha
dc.contributor.departmentTietotekniikan osastofi
dc.contributor.schoolTeknillinen korkeakoulufi
dc.contributor.schoolHelsinki University of Technologyen
dc.contributor.supervisorRuuth, Sampo
dc.date.accessioned2020-12-03T19:58:18Z
dc.date.available2020-12-03T19:58:18Z
dc.date.issued1996
dc.format.extent75
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/84341
dc.identifier.urnURN:NBN:fi:aalto-2020120343179
dc.language.isofien
dc.programme.majorSovellettu matematiikkafi
dc.programme.mcodeMat-2fi
dc.rights.accesslevelclosedAccess
dc.subject.keywordlinear programmingen
dc.subject.keywordlineaarinen ohjelmointifi
dc.subject.keywordcombinatorial optimizationen
dc.subject.keywordkokonaislukuoptimointifi
dc.subject.keywordBranch-and-Bound algorithmsen
dc.subject.keywordBranch-and-Bound -algoritmifi
dc.subject.keywordBranch-and-Cut algorithmsen
dc.subject.keywordBranch-and-Cut -algoritmifi
dc.titleModelling and solving combinatorial optimization problems with Branch-and-Cut algorithmsen
dc.titleKombinatoristen optimointiongelmien mallintaminen ja ratkaiseminen Branch-and-Cut -algoritmillafi
dc.type.okmG2 Pro gradu, diplomityö
dc.type.ontasotMaster's thesisen
dc.type.ontasotPro gradu -tutkielmafi
dc.type.publicationmasterThesis
local.aalto.digiauthask
local.aalto.digifolderAalto_40419
local.aalto.idinssi11448
local.aalto.inssilocationP1 Ark T80
local.aalto.openaccessno

Files