default search action
Hadi Charkhgard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Ashim Khanal, Vahid Mahmoodian, Osama M. Tarabih, Jiayi Hua, Mauricio E. Arias, Qiong Zhang, Hadi Charkhgard
:
AquaNutriOpt: Optimizing nutrients for controlling harmful algal blooms in Python - A case study of Lake Okeechobee. Environ. Model. Softw. 176: 106025 (2024) - [j34]Hadi Charkhgard, Jinkyoo Park, Changhyun Kwon
Special issue on advances in computational optimization and their modern applications. Optim. Lett. 18(9): 1961-1962 (2024) - [j33]Alvaro Sierra-Altamiranda, Hadi Charkhgard
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming. Optim. Lett. 18(9): 2051-2078 (2024) - [i3]George Dunn, Hadi Charkhgard, Ali Eshragh, Sasan Mahmoudinazlou, Elizabeth Stojanovski:
Deep Reinforcement Learning for Picker Routing Problem in Warehousing. CoRR abs/2402.03525 (2024) - [i2]Sasan Mahmoudinazlou, Abhay Sobhanan, Hadi Charkhgard, Ali Eshragh, George Dunn:
Deep Reinforcement Learning for Dynamic Order Picking in Warehouse Operations. CoRR abs/2408.01656 (2024) - 2023
- [j32]Payman Ghasemi Saghand
Solving multiplicative programs by binary-encoding the multiplication operation. Comput. Oper. Res. 159: 106340 (2023) - [j31]Uwe Aickelin
Guest Editorial Special Issue on Multiobjective Evolutionary Optimization in Machine Learning. IEEE Trans. Evol. Comput. 27(4): 746-748 (2023) - [j30]Mohammad Noroozi
An AI-Assisted Systematic Literature Review of the Impact of Vehicle Automation on Energy Consumption. IEEE Trans. Intell. Veh. 8(6): 3572-3592 (2023) - 2022
- [j29]Payman Ghasemi Saghand
Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization. Comput. Oper. Res. 137: 105549 (2022) - [j28]Seyyed Amir Babak Rasmi
Wave order picking under the mixed-shelves storage strategy: A solution method and advantages. Comput. Oper. Res. 137: 105556 (2022) - [j27]Fabien Tricoire
Addendum to "FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming" [Comput. Oper. Res. 112 (2019) 104760]. Comput. Oper. Res. 140: 105635 (2022) - [j26]Vahid Mahmoodian, Iman Dayarian, Payman Ghasemi Saghand, Yu Zhang, Hadi Charkhgard
A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs. INFORMS J. Comput. 34(3): 1453-1470 (2022) - [j25]Rui Dai
A robust biobjective optimization approach for operating a shared energy storage under price uncertainty. Int. Trans. Oper. Res. 29(3): 1627-1658 (2022) - [j24]Payman Ghasemi Saghand
A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach. Int. Trans. Oper. Res. 29(3): 1659-1687 (2022) - [c3]Yicheng Tu, Mehrad Eslami, Zichen Xu, Hadi Charkhgard:
Multi-Query Optimization Revisited: A Full-Query Algebraic Method. IEEE Big Data 2022: 252-261 - 2021
- [j23]Vahid Mahmoodian, Hadi Charkhgard, Yu Zhang:
Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs. Comput. Oper. Res. 128: 105178 (2021) - [j22]Mahdi Takalloo, Aigerim Bogyrbayeva, Hadi Charkhgard
Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles. Int. Trans. Oper. Res. 28(4): 1658-1680 (2021) - [j21]Aigerim Bogyrbayeva, Mahdi Takalloo, Hadi Charkhgard
An iterative combinatorial auction design for fractional ownership of autonomous vehicles. Int. Trans. Oper. Res. 28(4): 1681-1705 (2021) - [j20]Rui Dai
The Utilization of Shared Energy Storage in Energy Systems: A Comprehensive Review. IEEE Trans. Smart Grid 12(4): 3163-3174 (2021) - 2020
- [j19]Hadi Charkhgard
Bi-objective autonomous vehicle repositioning problem with travel time uncertainty. 4OR 18(4): 477-505 (2020) - [j18]Mehrad Eslami
Query batching optimization in database systems. Comput. Oper. Res. 121: 104983 (2020) - [j17]Alvaro Sierra-Altamiranda, Hadi Charkhgard
OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming. Int. Trans. Oper. Res. 27(2): 945-957 (2020)
2010 – 2019
- 2019
- [j16]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) - [j15]Aritra Pal, Hadi Charkhgard:
FPBH: A feasibility pump based heuristic for multi-objective mixed integer linear programming. Comput. Oper. Res. 112 (2019) - [j14]Natashia Boland
Preprocessing and cut generation techniques for multi-objective binary programming. Eur. J. Oper. Res. 274(3): 858-875 (2019) - [j13]Aritra Pal, Hadi Charkhgard
A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming. INFORMS J. Comput. 31(1): 115-133 (2019) - [j12]Alvaro Sierra-Altamiranda, Hadi Charkhgard
A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs. INFORMS J. Comput. 31(4): 823-840 (2019) - [c2]Mehrad Eslami, Yicheng Tu, Hadi Charkhgard, Zichen Xu, Jiacheng Liu:
PsiDB: A Framework for Batched Query Processing and Optimization. IEEE BigData 2019: 6046-6048 - [i1]Alvaro Sierra-Altamiranda, Hadi Charkhgard, Iman Dayarian, Ali Eshragh, Sorna Javadi:
Learning to Project in Multi-Objective Binary Linear Programming. CoRR abs/1901.10868 (2019) - 2018
- [j11]Hadi Charkhgard
Nondominated Nash points: application of biobjective mixed integer programming. 4OR 16(2): 151-171 (2018) - [j10]Hadi Charkhgard, Martin W. P. Savelsbergh, Masoud Talebian:
A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput. Oper. Res. 89: 17-30 (2018) - [j9]Rui Dai
Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage. Comput. Oper. Res. 96: 173-187 (2018) - [j8]Hadi Charkhgard
An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections. Discret. Optim. 30: 144-167 (2018) - [j7]Rui Dai
A two-stage approach for bi-objective integer linear programming. Oper. Res. Lett. 46(1): 81-87 (2018) - 2017
- [j6]Natashia Boland
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260(3): 873-885 (2017) - [j5]Natashia Boland
A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260(3): 904-919 (2017) - 2016
- [j4]Rasul Esmaeilbeigi
Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations. Eur. J. Oper. Res. 251(2): 419-431 (2016) - [j3]Natashia Boland
The L-shape search method for triobjective integer programming. Math. Program. Comput. 8(2): 217-251 (2016) - 2015
- [j2]Natashia Boland
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. INFORMS J. Comput. 27(4): 597-618 (2015) - [j1]Natashia Boland
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. INFORMS J. Comput. 27(4): 735-754 (2015) - 2014
- [c1]Natashia Boland
The Triangle Splitting Method for Biobjective Mixed Integer Programming. IPCO 2014: 162-173
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 2024-11-07 21:32 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: