James T. Hungerford

According to our database, James T. Hungerford authored at least 7 papers between 2014 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs.

Antonio Frangioni, Claudio Gentile, James T. Hungerford

Math. Oper. Res., 2020

2019

A General Regularized Continuous Formulation for the Maximum Clique Problem.

James T. Hungerford, Francesco Rinaldi

Math. Oper. Res., 2019

2018

A multilevel bilinear programming algorithm for the vertex separator problem.

William W. Hager, James T. Hungerford, Ilya Safro

Comput. Optim. Appl., 2018

2016

An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem.

Timothy A. Davis, William W. Hager, James T. Hungerford

ACM Trans. Math. Softw., 2016

2015

Continuous quadratic programming formulations of optimization problems on graphs.

William W. Hager, James T. Hungerford

Eur. J. Oper. Res., 2015

2014

Optimality conditions for maximizing a function over a polyhedron.

William W. Hager, James T. Hungerford

Math. Program., 2014

A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators.

William W. Hager, James T. Hungerford, Ilya Safro

Proceedings of the Learning and Intelligent Optimization, 2014