Sign in
A branch-and-cut approach for the maximum capture facility location problem with random utilities Part 2
Home - Activities
Home - ActivitiesReporter：
Wei-Kun Chen, Assistant Professor, School of Mathematics and Statistics, Beijing Institute of Technology
Inviter：
Yafeng Liu, Associate Professor
Subject：
A branch-and-cut approach for the maximum capture facility location problem with random utilities Part 2
Time and place：
10:00-11:00 July 2 (Sunday), Z301
Abstract：
We introduce a branch-and-cut approach for this difficult mixed-integer fractional programming problem. The approach combines two types of cutting planes that exploit particular properties of the objective function: the first one are the outer-approximation cuts and the second one are the submodular cuts. We will also discuss the extension of the branch-and-cut approach to the mixed-integer fractional programming problems arising in signal processing.