![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Gitae Kim
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j6]Gitae Kim, Jinsik Choe:
Optimal Routing for Vehicles and Pedestrians in the Urban Area. Int. J. Softw. Innov. 10(1): 1-18 (2022) - 2021
- [c9]Jinsik Choe, Gitae Kim:
Order crossover problem with variable lead time. SNPD Winter 2021: 183-186
2010 – 2019
- 2018
- [c8]Gitae Kim:
Optimal Vehicle Routing for Parcel Delivery with Considering Two Time Periods. IEEM 2018: 918-922 - 2016
- [j5]Gitae Kim, Yew-Soon Ong
, Taesu Cheong, Puay Siew Tan
:
Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion. IEEE Trans. Intell. Transp. Syst. 17(8): 2367-2380 (2016) - 2015
- [j4]Gitae Kim, Kan Wu
, Edward Huang
:
Optimal inventory control in a multi-period newsvendor problem with non-stationary demand. Adv. Eng. Informatics 29(1): 139-145 (2015) - [j3]Gitae Kim, Yew-Soon Ong
, Chen Kim Heng, Puay Siew Tan
, Nengsheng Allan Zhang
:
City Vehicle Routing Problem (City VRP): A Review. IEEE Trans. Intell. Transp. Syst. 16(4): 1654-1666 (2015) - 2013
- [j2]Gitae Kim, Chih-Hang Wu
:
Scenario aggregation for supply chain quantity-flexibility contract. Int. J. Syst. Sci. 44(11): 2166-2182 (2013) - 2012
- [j1]Gitae Kim, Chih-Hang Wu
, Sungmook Lim
, Jumi Kim:
Modified matrix splitting method for the support vector machine and its application to the credit classification of companies in Korea. Expert Syst. Appl. 39(10): 8824-8834 (2012)
2000 – 2009
- 2001
- [c7]Gitae Kim, Tony J. Bogovic:
Active ingress monitoring (AIM): an intrusion isolation scheme in active networks. ICC 2001: 194-198 - [c6]Gitae Kim, Tony J. Bogovic, Dana Chee:
ACtive edge-Tagging (ACT): An Intruder Identification & Isolation Scheme in Active Networks. ISCC 2001: 29-34
1990 – 1999
- 1999
- [c5]Rajesh R. Talpade, Gitae Kim, Sumit Khurana:
NOMAD: Traffic-based Network Monitoring Framework for Anomaly Detection. ISCC 1999: 442-452 - 1997
- [c4]Azer Bestavros
, Gitae Kim:
Implementation and Performance Evaluation of TCP Boston: A Fragmentation-Tolerant TCP Protocol for ATM Networks. ICC (2) 1997: 1049-1053 - [c3]Azer Bestavros
, Gitae Kim:
TCP Boston: A Fragmentation-Tolerant TCP Protocol for ATM Networks. INFOCOM 1997: 1210-1217 - [c2]Azer Bestavros
, Gitae Kim:
Exploiting Redundancy for Timeliness in TCP Boston. IEEE Real Time Technology and Applications Symposium 1997: 184-190 - 1996
- [c1]Kihong Park, Gitae Kim, Mark Crovella:
On the relationship between file sizes, transport protocols, and self-similar network traffic. ICNP 1996: 171-180
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint