Recent advances in solving some optimization problems in graphs by quadratic programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Recent advances in solving some optimization problems in graphs by quadratic programming

Abstract

We review Quadratic Convex Reformulation (QCR) for quadratic pro- grams with general integer variables. This solution 2-phase approach consist in first reformulating the quadratic program into an equivalent other problem having a convex ob jective function. The second phase relies on MIP solvers that solve the reformulated problem by standard branch-and-b ound. Then, we consider some graph partitioning problems that can be formulated as quadratic programs with binary variables. We show many enhancements of the standard QCR method that efficiently solve graph partitioning problems
No file

Dates and versions

hal-01126525 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01126525 , version 1

Cite

Sourour Elloumi, Amélie Lambert. Recent advances in solving some optimization problems in graphs by quadratic programming. Ninth International Colloquium on Graphs and Optimization. GO IX, Jul 2014, X, Italy. pp.1. ⟨hal-01126525⟩
42 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More