A Quadratic Programming Approach to the Graph Edit Distance Problem

Author(s):  
Michel Neuhaus ◽  
Horst Bunke
2019 ◽  
Vol 106 ◽  
pp. 225-235 ◽  
Author(s):  
Mostafa Darwiche ◽  
Donatello Conte ◽  
Romain Raveaux ◽  
Vincent T’Kindt

Author(s):  
Elena Rica ◽  
Susana Álvarez ◽  
Francesc Serratosa

2019 ◽  
Vol 163 ◽  
pp. 762-775 ◽  
Author(s):  
Xiaoyang Chen ◽  
Hongwei Huo ◽  
Jun Huan ◽  
Jeffrey Scott Vitter

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Syaripuddin ◽  
Herry Suprajitno ◽  
Fatmawati

Quadratic programming with interval variables is developed from quadratic programming with interval coefficients to obtain optimum solution in interval form, both the optimum point and optimum value. In this paper, a two-level programming approach is used to solve quadratic programming with interval variables. Procedure of two-level programming is transforming the quadratic programming model with interval variables into a pair of classical quadratic programming models, namely, the best optimum and worst optimum problems. The procedure to solve the best and worst optimum problems is also constructed to obtain optimum solution in interval form.


Sign in / Sign up

Export Citation Format

Share Document