Paper Info
Title
Continuous quadratic programming formulations of optimization problems on graphs.
Abstract
•Vertex separator problem is reformulated as a continuous bilinear quadratic program.•Objective function has equal number of positive and negative eigenvalues.•Objective function is convex on edges of constraint polyhedron.
Year
DOI
Venue
2015
10.1016/j.ejor.2014.05.042
European Journal of Operational Research
Keywords
Field
DocType
Vertex separator,Graph partitioning,Maximum clique,Continuous formulation,Quadratic programming
Discrete mathematics,Mathematical optimization,Maximum common subgraph isomorphism problem,Edge cover,Independent set,Vertex cover,Vertex separator,Quadratic programming,Optimization problem,Feedback vertex set,Mathematics
Journal
Volume
Issue
ISSN
240
2
0377-2217
Citations 
PageRank 
References 
8
0.50
36
Authors
2
Name
Order
Citations
PageRank
William W. Hager11603214.67
James T. Hungerford280.50