Branch and cut method for solving integer indefinite quadratic bilevel programs

2022 ◽  
Author(s):  
Nacéra Maachou ◽  
Mustapha Moulaï
Keyword(s):  
Branch And Cut ◽  
Cut Method ◽  
Indefinite Quadratic ◽  
Bilevel Programs ◽  
Branch And Cut Method

scholarly journals A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables

2016 ◽  
Vol 165 (2) ◽  
pp. 549-577 ◽  
Author(s):  
Chen Chen ◽  
Alper Atamtürk ◽  
Shmuel S. Oren
Keyword(s):  
Complex Variables ◽  
Branch And Cut ◽  
Bounded Complex ◽  
Cut Method ◽  
Branch And Cut Method

Separator-Based Pruned Dynamic Programming for Steiner Tree

2019 ◽  
Vol 33 ◽  
pp. 1520-1527 ◽  
Author(s):  
Yoichi Iwata ◽  
Takuto Shigemura
Keyword(s):  
Dynamic Programming ◽  
Real World ◽  
Steiner Tree ◽  
Empirical Evaluation ◽  
Branch And Cut ◽  
Hard Problem ◽  
Cut Method ◽  
Np Hard Problem ◽  
Branch And Cut Method ◽  
Pruning Technique

Steiner tree is a classical NP-hard problem that has been extensively studied both theoretically and empirically. In theory, the fastest approach for inputs with a small number of terminals uses the dynamic programming, but in practice, stateof-the-art solvers are based on the branch-and-cut method. In this paper, we present a novel separator-based pruning technique for speeding up a theoretically fast DP algorithm. Our empirical evaluation shows that our pruned DP algorithm is quite effective against real-world instances admitting small separators, scales to more than a hundred terminals, and is competitive with a branch-and-cut solver.

Sign in / Sign up

Export Citation Format

Share Document