default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBissan Ghaddar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Zhenan Fan, Bissan Ghaddar, Xinglu Wang, Linzi Xing, Yong Zhang, Zirui Zhou:
Artificial Intelligence for Operations Research: Revolutionizing the Operations Research Process. CoRR abs/2401.03244 (2024)- 2023
- [j22]Bissan Ghaddar, Ignacio Gómez-Casares
, Julio González-Díaz, Brais González-Rodríguez, Beatriz Pateiro-López, Sofía Rodríguez-Ballesteros:
Learning for Spatial Branching: An Algorithm Selection Approach. INFORMS J. Comput. 35(5): 1024-1043 (2023) - [j21]Olga Kuryatnikova, Bissan Ghaddar, Daniel K. Molzahn:
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow. SIAM J. Optim. 33(4): 2830-2857 (2023) - [i7]Rindranirina Ramamonjison, Timothy T. L. Yu, Raymond Li, Haley Li, Giuseppe Carenini, Bissan Ghaddar, Shiqi He, Mahdi Mostajabdaveh, Amin Banitalebi-Dehkordi, Zirui Zhou, Yong Zhang:
NL4Opt Competition: Formulating Optimization Problems Based on Their Natural Language Descriptions. CoRR abs/2303.08233 (2023) - 2022
- [j20]Gopika Premsankar, Bissan Ghaddar:
Energy-Efficient Service Placement for Latency-Sensitive Applications in Edge Computing. IEEE Internet Things J. 9(18): 17926-17937 (2022) - [j19]Bo Lin, Bissan Ghaddar, Jatin Nathwani:
Deep Reinforcement Learning for the Electric Vehicle Routing Problem With Time Windows. IEEE Trans. Intell. Transp. Syst. 23(8): 11528-11538 (2022) - [i6]Bissan Ghaddar, Ignacio Gómez-Casares, Julio González-Díaz, Brais González-Rodríguez, Beatriz Pateiro-López, Sofía Rodríguez-Ballesteros:
Learning for Spatial Branching: An Algorithm Selection Approach. CoRR abs/2204.10834 (2022) - [i5]Brais González-Rodríguez, Raúl Alvite-Pazó, Samuel Alvite-Pazó, Bissan Ghaddar, Julio González-Díaz:
Polynomial Optimization: Enhancing RLT relaxations with Conic Constraints. CoRR abs/2208.05608 (2022) - 2021
- [j18]Claudio Gambella, Bissan Ghaddar, Joe Naoum-Sawaya:
Optimization problems for machine learning: A survey. Eur. J. Oper. Res. 290(3): 807-828 (2021) - [c5]Rindranirina Ramamonjison, Timothy T. L. Yu, Raymond Li, Haley Li, Giuseppe Carenini, Bissan Ghaddar, Shiqi He, Mahdi Mostajabdaveh, Amin Banitalebi-Dehkordi, Zirui Zhou, Yong Zhang:
NL4Opt Competition: Formulating Optimization Problems Based on Their Natural Language Descriptions. NeurIPS (Competition and Demos) 2021: 189-203 - [i4]Bo Lin, Bissan Ghaddar, Ada Hurst:
Text Mining Undergraduate Engineering Programs' Applications: the Role of Gender, Nationality, and Socio-economic Status. CoRR abs/2107.14034 (2021) - 2020
- [j17]Gopika Premsankar, Bissan Ghaddar, Mariusz Slabicki, Mario Di Francesco:
Optimal Configuration of LoRa Networks in Smart Cities. IEEE Trans. Ind. Informatics 16(12): 7243-7254 (2020) - [i3]Bo Lin, Bissan Ghaddar, Jatin Nathwani:
Deep Reinforcement Learning for Electric Vehicle Routing Problem with Time Windows. CoRR abs/2010.02068 (2020)
2010 – 2019
- 2019
- [j16]Xiaolong Kuang, Bissan Ghaddar, Joe Naoum-Sawaya, Luis F. Zuluaga:
Alternative SDP and SOCP approximations for polynomial optimization. EURO J. Comput. Optim. 7(2): 153-175 (2019) - [j15]Bissan Ghaddar, Rabih A. Jabr:
Power transmission network expansion planning: A semidefinite programming branch-and-bound approach. Eur. J. Oper. Res. 274(3): 837-844 (2019) - [j14]Taha Selim Ustun, S. M. Suhail Hussain, Hannes Kirchhoff, Bissan Ghaddar, Kai Strunz, Ioannis Lestas:
Data Standardization for Smart Infrastructure in First-Access Electricity Systems. Proc. IEEE 107(9): 1790-1802 (2019) - [i2]Claudio Gambella, Bissan Ghaddar, Joe Naoum-Sawaya:
Optimization Models for Machine Learning: A Survey. CoRR abs/1901.05331 (2019) - 2018
- [j13]Bissan Ghaddar, Joe Naoum-Sawaya:
High dimensional data classification and feature selection using support vector machines. Eur. J. Oper. Res. 265(3): 993-1004 (2018) - [j12]Claudio Gambella, Joe Naoum-Sawaya, Bissan Ghaddar:
The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches. INFORMS J. Comput. 30(3): 554-569 (2018) - [c4]Gopika Premsankar, Bissan Ghaddar, Mario Di Francesco, Rudi Verago:
Efficient placement of edge computing devices for vehicular applications in smart cities. NOMS 2018: 1-9 - 2017
- [j11]Bissan Ghaddar, Mathieu Claeys, Martin Mevissen, Bradley J. Eck:
Polynomial optimization for water networks: Global solutions for the valve setting problem. Eur. J. Oper. Res. 261(2): 450-459 (2017) - [j10]Joe Naoum-Sawaya, Bissan Ghaddar:
Cutting plane approach for the maximum flow interdiction problem. J. Oper. Res. Soc. 68(12): 1553-1569 (2017) - 2016
- [j9]Bissan Ghaddar, Nizar Sakr, Yaw Asiedu:
Spare parts stocking analysis using genetic programming. Eur. J. Oper. Res. 252(1): 136-144 (2016) - [j8]Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
A dynamic inequality generation scheme for polynomial programming. Math. Program. 156(1-2): 21-57 (2016) - 2015
- [j7]Bissan Ghaddar, Joe Naoum-Sawaya, Akihiro Kishimoto, Nicole Taheri, Bradley Eck:
A Lagrangian decomposition approach for the pump scheduling problem in water networks. Eur. J. Oper. Res. 241(2): 490-501 (2015) - [j6]Joe Naoum-Sawaya, Bissan Ghaddar, Ernesto Arandia, Bradley Eck:
Simulation-optimization approaches for water pump scheduling and pipe replacement problems. Eur. J. Oper. Res. 246(1): 293-306 (2015) - [c3]Riccardo Guidotti, Andrea Sassi, Michele Berlingerio, Alessandra Pascale, Bissan Ghaddar:
Social or Green? A Data-Driven Approach for More Enjoyable Carpooling. ITSC 2015: 842-847 - 2014
- [i1]Bissan Ghaddar, Jakub Marecek, Martin Mevissen:
Optimal Power Flow as a Polynomial Optimization Problem. CoRR abs/1404.3626 (2014) - 2012
- [j5]Bissan Ghaddar, Joe Naoum-Sawaya:
Environmentally friendly facility location with market competition. J. Oper. Res. Soc. 63(7): 899-908 (2012) - 2011
- [b1]Bissan Ghaddar:
New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems. University of Waterloo, Ontario, Canada, 2011 - [j4]Bissan Ghaddar, Miguel F. Anjos, Frauke Liers:
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Ann. Oper. Res. 188(1): 155-174 (2011) - [j3]Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs. SIAM J. Optim. 21(1): 391-414 (2011) - [c2]Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. IPCO 2011: 207-222 - 2010
- [j2]Joe Naoum-Sawaya, Bissan Ghaddar:
A Fuzzy Adaptation Method for Improving Link Utilization and Reducing Network Delays in IEEE 802.11e Wireless Ad Hoc Networks. Ad Hoc Sens. Wirel. Networks 9(3-4): 203-222 (2010)
2000 – 2009
- 2006
- [j1]Hassan Artail, Haïdar Safa, Joe Naoum-Sawaya, Bissan Ghaddar, Sami Khawam:
A simple recursive scheme for adjusting the contention window size in IEEE 802.11e wireless ad hoc networks. Comput. Commun. 29(18): 3789-3803 (2006) - 2005
- [c1]Joe Naoum-Sawaya, Bissan Ghaddar, Sami Khawam, Haïdar Safa, Hassan Artail, Zaher Dawy:
Adaptive approach for QoS support in IEEE 802.11e wireless LAN. WiMob (2) 2005: 167-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-10-07 22:12 CEST 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:
