Hong Sung-Pil

Sung-Pil Hong

Information about the author Sung-Pil Hong will soon be added to the site.
Found 12 papers in total
Handelman rank of zero‐diagonal quadratic programs over a hypercube and its applications
Handelman rank of zero‐diagonal quadratic programs over a hypercube and its applications
2013
It has been observed that the Handelman’s certificate of positivity of a...
Rank of Handelman hierarchy for Max‐Cut
Rank of Handelman hierarchy for Max‐Cut
2011
We apply Handelman hierarchy to a standard quadratic formulation of Max‐Cut. We...
An appraisal of a column‐generation‐based algorithm for centralized train‐conflict resolution on a metropolitan railway network
An appraisal of a column‐generation‐based algorithm for centralized train‐conflict resolution on a metropolitan railway network
2011
In practice, a train‐conflict resolution is decentralized around dispatchers...
Polynomiality of sparsest cuts with fixed number of sources
Polynomiality of sparsest cuts with fixed number of sources
2007
We show that when the number of sources is constant the sparsest cut problem is...
Improved algorithms for minimum cost replicated web contents distribution tree
Improved algorithms for minimum cost replicated web contents distribution tree
2005
Recently, Tang and Chanson proposed a minimum cost distribution model for replicated...
A study on the analysis of NCW (Network Centric Warfare) combat effectiveness using cellular automata simulation
A study on the analysis of NCW (Network Centric Warfare) combat effectiveness using cellular automata simulation
2005
The recent notion of Network Centric Warfare (NCW) emphasizes the ability to...
About fully polynomial approximability of the generalized knapsack problem
About fully polynomial approximability of the generalized knapsack problem
2003
The generalized knapsack problem or gknap is the combinatorial optimization problem of...
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
2004
We propose a fully polynomial bicriteria approximation scheme for the constrained...
A survey: Semidefinite programming, its duality, complexity and applications
A survey: Semidefinite programming, its duality, complexity and applications
2001
SDP (Semidefinite Programming), as a sort of ‘cone-LP’, optimizes a linear...
A complexity analysis of a ‘pragmatic’ relaxation method for combinatorial optimization with a side constraint
A complexity analysis of a ‘pragmatic’ relaxation method for combinatorial optimization with a side constraint
2000
We perform a computational complexity analysis of a heuristic algorithm proposed in...
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
1995
The authors present new strongly polynomial algorithms for special cases of convex...
A note on the strong polynomiality of convex quadratic programming
A note on the strong polynomiality of convex quadratic programming
1995
The authors prove that a general convex quadratic program (QP) can be reduced to the...
Papers per page: