Cho Geon

Geon Cho

Information about the author Geon Cho will soon be added to the site.
Found 8 papers in total
A study on developing an efficient algorithm for the p-median problem on a tree network
A study on developing an efficient algorithm for the p-median problem on a tree network
2004
Given a tree network on which each node has its own demand and also stands for a...
An empirical study for satisfiability problems in propositional logic using set covering formulation
An empirical study for satisfiability problems in propositional logic using set covering formulation
2002
A satisfiability problem in propositional logic is the problem of checking for the...
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
1998
The tree knapsack problem (TKP) is a generalized 0–1 knapsack problem where all...
A decomposition algorithm for a local access telecommunication network design problem
A decomposition algorithm for a local access telecommunication network design problem
1998
In this paper, we develop detailed algorithms for implementing the so-called Limited...
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
1997
The Tree Knapsack Problem (TKP) can be regarded as a 0–1 knapsack problem on a...
An algorithm for computing the fundamental matrix of a Markov chain
An algorithm for computing the fundamental matrix of a Markov chain
1997
A stable algorithm for computing the fundamental matrix ( I–Q ) –1 of a...
A branch and bound algorithm for solving a capacitated subtree of a tree problem in local access telecommunication networks
A branch and bound algorithm for solving a capacitated subtree of a tree problem in local access telecommunication networks
1997
Given a rooted tree T with node profits and node demands, the capacitated subtree of a...
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
1997
Given a rooted tree T with node profits and node demands, the capacitated subtree of a...
Papers per page: