Algorithms and applications for a class of bilevel MILPs

DOI10.1016/j.dam.2018.02.015zbMath1435.90086OpenAlexW2795484439MaRDI QIDQ2283108

Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion

Publication date: 30 December 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.015

zbMATH Keywords

zero forcing setpower edge setbilevel MILP

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items

A survey on mixed-integer programming techniques in bilevel optimization, Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy

Uses Software

• CPLEX
• Julia

Cites Work

• Unnamed Item
• Unnamed Item
• Bilevel programming and the separation problem
• Propagation time for zero forcing on a graph
• Bilevel programming: a survey
• Linear bilevel programming with upper level constraints depending on the lower level solution
• Discrete linear bilevel programming problem
• New branch-and-Cut algorithm for bilevel linear programming
• Zero forcing sets and the minimum rank of graphs
• A note on power domination in grid graphs
• Julia: A Fresh Approach to Numerical Computing
• Intersection Cuts for Bilevel Optimization
• Bilevel Knapsack with Interdiction Constraints
• A Study on the Computational Complexity of the Bilevel Knapsack Problem
• Computing in Operations Research Using Julia
• Observing the State of a Smart Grid Using Bilevel Programming
• L’algebre de Boole et ses applications en recherche operationnelle
• The power edge set problem
• Minimum vertex blocker clique problem
• Shortest-path network interdiction
• Domination in Graphs Applied to Electric Power Networks
• The Mixed Integer Linear Bilevel Programming Problem
• The PMU Placement Problem