default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChanghyun Kwon 0001
Person information
- affiliation: KAIST, Department of Industrial and Systems Engineering, Daejeon, Republic of Korea
- affiliation (PhD 2008): Pennsylvania State University, USA
Other persons with the same name
- Changhyun Kwon — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j32]Xufei Liu
, Sung Hoon Chung, Changhyun Kwon:
An adaptive large neighborhood search method for the drone-truck arc routing problem. Comput. Oper. Res. 176: 106959 (2025)- 2024
- [j31]Sasan Mahmoudinazlou, Changhyun Kwon:
A hybrid genetic algorithm for the min-max Multiple Traveling Salesman Problem. Comput. Oper. Res. 162: 106455 (2024) - [j30]Sasan Mahmoudinazlou, Changhyun Kwon:
A hybrid genetic algorithm with type-aware chromosomes for Traveling Salesman Problems with Drone. Eur. J. Oper. Res. 318(3): 719-739 (2024) - [j29]Hyeonah Kim, Jinkyoo Park, Changhyun Kwon:
A Neural Separation Algorithm for the Rounded Capacity Inequalities. INFORMS J. Comput. 36(4): 987-1005 (2024) - [j28]Hadi Charkhgard, Jinkyoo Park, Changhyun Kwon:
Special issue on advances in computational optimization and their modern applications. Optim. Lett. 18(9): 1961-1962 (2024) - 2023
- [j27]Xufei Liu, Sang Won Kim, Changhyun Kwon:
An adaptive large neighborhood search method for rebalancing free-floating electric vehicle sharing systems. Comput. Oper. Res. 155: 106220 (2023) - 2022
- [j26]Aigerim Bogyrbayeva, Sungwook Jang, Ankit Shah, Young Jae Jang, Changhyun Kwon:
A Reinforcement Learning Approach for Rebalancing Electric Vehicle Sharing Systems. IEEE Trans. Intell. Transp. Syst. 23(7): 8704-8714 (2022) - 2021
- [j25]Aigerim Bogyrbayeva, Changhyun Kwon:
Pessimistic evasive flow capturing problems. Eur. J. Oper. Res. 293(1): 133-148 (2021) - [j24]Mahdi Takalloo, Aigerim Bogyrbayeva, Hadi Charkhgard, Changhyun Kwon:
Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles. Int. Trans. Oper. Res. 28(4): 1658-1680 (2021) - [j23]Aigerim Bogyrbayeva, Mahdi Takalloo, Hadi Charkhgard, Changhyun Kwon:
An iterative combinatorial auction design for fractional ownership of autonomous vehicles. Int. Trans. Oper. Res. 28(4): 1681-1705 (2021) - 2020
- [j22]Masoumeh Taslimi, Rajan Batta, Changhyun Kwon:
Medical waste collection considering transportation and storage risk. Comput. Oper. Res. 120: 104966 (2020) - [j21]Xufei Liu, Changhyun Kwon:
Exact robust solutions for the combined facility location and network design problem in hazardous materials transportation. IISE Trans. 52(10): 1156-1172 (2020) - [j20]Mahdi Takalloo, Changhyun Kwon:
Sensitivity of wardrop equilibria: revisited. Optim. Lett. 14(3): 781-796 (2020) - [j19]Liu Su, Changhyun Kwon:
Risk-Averse Network Design with Behavioral Conditional Value-at-Risk for Hazardous Materials Transportation. Transp. Sci. 54(1): 184-203 (2020) - [j18]Mahdi Takalloo, Changhyun Kwon:
On the Price of Satisficing in Network User Equilibria. Transp. Sci. 54(6): 1555-1570 (2020) - 2019
- [j17]Payman Ghasemi Saghand, Hadi Charkhgard, Changhyun Kwon:
A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach. Comput. Oper. Res. 101: 263-274 (2019) - [j16]Liu Su, Longsheng Sun, Mark H. Karwan, Changhyun Kwon:
Spectral risk measure minimization in hazardous materials transportation. IISE Trans. 51(6): 638-652 (2019) - 2018
- [j15]Zulqarnain Haider, Alexander G. Nikolaev, Jee Eun Kang, Changhyun Kwon:
Inventory rebalancing through pricing in public bike sharing systems. Eur. J. Oper. Res. 270(1): 103-117 (2018) - [j14]Longsheng Sun, Mark H. Karwan, Changhyun Kwon:
Generalized Bounded Rationality and Robust Multicommodity Network Design. Oper. Res. 66(1): 42-57 (2018) - [j13]Tolou Esfandeh, Rajan Batta, Changhyun Kwon:
Time-Dependent Hazardous-Materials Network Design Problem. Transp. Sci. 52(2): 454-473 (2018) - 2017
- [j12]Masoumeh Taslimi, Rajan Batta, Changhyun Kwon:
A comprehensive modeling framework for hazmat network design, hazmat response team location, and equity of risk. Comput. Oper. Res. 79: 119-130 (2017) - 2016
- [j11]Iakovos Toumazis, Changhyun Kwon:
Worst-Case Conditional Value-at-Risk Minimization for Hazardous Materials Transportation. Transp. Sci. 50(4): 1174-1187 (2016) - [j10]Longsheng Sun, Mark H. Karwan, Changhyun Kwon:
Robust Hazmat Network Design Problems Considering Risk Uncertainty. Transp. Sci. 50(4): 1188-1203 (2016) - 2015
- [j9]Sung Hoon Chung, Changhyun Kwon:
Multi-period planning for electric car charging station locations: A case of Korean Expressways. Eur. J. Oper. Res. 242(2): 677-687 (2015) - 2014
- [j8]Taehan Lee, Changhyun Kwon:
A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 4OR 12(4): 373-378 (2014) - [j7]Yingying Kang, Rajan Batta, Changhyun Kwon:
Value-at-Risk model for hazardous material transportation. Ann. Oper. Res. 222(1): 361-387 (2014) - [j6]Yingying Kang, Rajan Batta, Changhyun Kwon:
Generalized route planning model for hazardous material transportation with VaR and equity considerations. Comput. Oper. Res. 43: 237-247 (2014) - 2012
- [j5]Md. Tanveer Ahmed, Changhyun Kwon:
Pricing game of online display advertisement publishers. Eur. J. Oper. Res. 219(2): 477-487 (2012) - [j4]A. Srinivasan, Changhyun Kwon:
Operations of online advertising services and publisher's option. J. Oper. Res. Soc. 63(5): 674-682 (2012) - [j3]Byung Do Chung, Jiahan Li, Tao Yao, Changhyun Kwon, Terry L. Friesz:
Demand Learning and Dynamic Pricing under Competition in a State-Space Framework. IEEE Trans. Engineering Management 59(2): 240-249 (2012) - 2009
- [j2]Changhyun Kwon, Terry L. Friesz, Reetabrata Mookherjee, Tao Yao, Baichun Feng:
Non-cooperative competition among revenue maximizing service providers with demand learning. Eur. J. Oper. Res. 197(3): 981-996 (2009) - 2008
- [j1]Changhyun Kwon, Terry L. Friesz:
Valuation of American options by the gradient projection method. Appl. Math. Comput. 206(1): 380-388 (2008)
Conference and Workshop Papers
- 2023
- [c1]Junyoung Park, Changhyun Kwon, Jinkyoo Park:
Learn to Solve the Min-max Multiple Traveling Salesmen Problem with Reinforcement Learning. AAMAS 2023: 878-886
Informal and Other Publications
- 2024
- [i9]Federico Berto, Chuanbo Hua, Laurin Luttmann, Jiwoo Son, Junyoung Park, Kyuree Ahn, Changhyun Kwon, Lin Xie, Jinkyoo Park:
PARCO: Learning Parallel Autoregressive Policies for Efficient Multi-Agent Combinatorial Optimization. CoRR abs/2409.03811 (2024) - 2023
- [i8]Sasan Mahmoudinazlou, Changhyun Kwon:
A Hybrid Genetic Algorithm with Type-Aware Chromosomes for Traveling Salesman Problems with Drone. CoRR abs/2303.00614 (2023) - [i7]Hyeonah Kim, Jinkyoo Park, Changhyun Kwon:
A Neural Separation Algorithm for the Rounded Capacity Inequalities. CoRR abs/2306.17283 (2023) - [i6]Abhay Sobhanan, Junyoung Park, Jinkyoo Park, Changhyun Kwon:
Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems. CoRR abs/2310.14157 (2023) - 2021
- [i5]Aigerim Bogyrbayeva, Taehyun Yoon, Hanbum Ko, Sungbin Lim, Hyokun Yun, Changhyun Kwon:
A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone. CoRR abs/2112.12545 (2021) - 2020
- [i4]Mahdi Takalloo, Changhyun Kwon:
Sensitivity of Wardrop Equilibria: Revisited. CoRR abs/2002.05510 (2020) - [i3]Aigerim Bogyrbayeva, Sungwook Jang, Ankit Shah, Young Jae Jang, Changhyun Kwon:
A Reinforcement Learning Approach for Rebalancing Electric Vehicle Sharing Systems. CoRR abs/2010.02369 (2020) - 2019
- [i2]Mahdi Takalloo, Changhyun Kwon:
On the Price of Satisficing in Network User Equilibria. CoRR abs/1911.07914 (2019) - 2012
- [i1]Terry L. Friesz, Changhyun Kwon, Tae Il Kim, Lifan Fan, Tao Yao:
Competitive Robust Dynamic Pricing in Continuous Time with Fixed Inventories. CoRR abs/1208.4374 (2012)
Coauthor Index
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 2025-02-14 02:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
