The following pages link to Seong-In Kim (Q218220):
Displaying 17 items.
- Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum (Q732896) (← links)
- (Q1081234) (redirect page) (← links)
- Minisum amd minimax paths of a moving facility on a network (Q1186001) (← links)
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
- A simple variational problem for a moving vehicle (Q1892105) (← links)
- A new reformulation approach for the generalized partial covering problem (Q3423275) (← links)
- (Q3765555) (← links)
- Estimation of transition probabilities in a two-state markov chain (Q3885016) (← links)
- On parameter estimation in Bernoulli trials with dependence (Q3909874) (← links)
- Variational Problems for Determining Optimal Paths of a Moving Facility (Q4024321) (← links)
- (Q4352214) (← links)
- A branch-and-cut algorithm for solving an intraring synchronous optical network design problem (Q4488863) (← links)
- Probabilistic partial set covering problems (Q5202816) (← links)
- On unbiased multinomial estimation (Q5903235) (← links)
- An ATM switch capacity allocation problem (Q5950377) (← links)
- On unbiased multinomial estimation (Q5966460) (← links)
