期刊
DISCRETE APPLIED MATHEMATICS
卷 272, 期 -, 页码 75-89出版社
ELSEVIER
DOI: 10.1016/j.dam.2018.02.015
关键词
Bilevel MILP; Power edge set; Zero forcing set
资金
- French ADEME agency under SO -grid project
- Fondation Mathematique Jacques Hadamard (FMJH) under the Gaspard Monge Program (PGMO) in optimization and operations research
- European Union [316647]
- EDF
We study a class of bilevel mixed-integer linear programs with the following restrictions: all upper level variables x are binary, the lower level variables y occur in exactly one upper level constraint gamma x + beta y >= c, and the lower level objective function is min (y)beta y. We propose a new cut generation algorithm to solve this problem class, based on two simplifying assumptions. We then propose a row-and-column generation algorithm that works independently of the assumptions. We apply our methods to two problems: one is related to the optimal placement of measurement devices in an electrical network, and the other is the minimum zero forcing set problem, a variant of the dominating set problem. We exhibit computational results of both methods on the application-oriented instances as well as on randomly generated instances. (C) 2018 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据