Park June S.

June S. Park

Information about the author June S. Park will soon be added to the site.
Found 7 papers in total
Benders-and-cut algorithm for fixed-charge capacitated network design problem
Benders-and-cut algorithm for fixed-charge capacitated network design problem
2000
We develop a Benders-and-cut algorithm for fixed-charge capacitated network design...
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
1998
This paper develops a Lagrangian dual-based branch-and-bound algorithm for the...
Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms
Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms
1998
In this article, we construct a mathematical model to design the topology of a network...
Stability of p-persistent CSMA/CD
Stability of p-persistent CSMA/CD
1995
A semi-Markovian model is developed for slotted p -persistent CSMA/CD with a finite...
A hub location problem in designing digital data service networks: Lagrangian relaxation approach
A hub location problem in designing digital data service networks: Lagrangian relaxation approach
1996
This paper develops a graph-based model and a Lagrangian relaxation scheme to find a...
Optimal inspection policy in sequential screening
Optimal inspection policy in sequential screening
1991
Under sequential screening, a production lot is inspected item-by-item; the decision...
Optimal reorganization policies for stationary and evolutionary databases
Optimal reorganization policies for stationary and evolutionary databases
1990
The problem of determining optimal reorganization policies for databases which employ...
Papers per page: