default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamir Elhedhli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Jordan Kiss
, Samir Elhedhli:
Capacity acquisition and PPE distribution planning during the COVID-19 pandemic. Comput. Ind. Eng. 187: 109715 (2024)- 2023
- [j42]Gohram Baloch, Fatma Gzara, Samir Elhedhli:
Risk-based allocation of COVID-19 personal protective equipment under supply shortages. Eur. J. Oper. Res. 310(3): 1085-1100 (2023) - [j41]Joe Naoum-Sawaya, Samir Elhedhli, Paulo De Carvalho:
Strategic blockchain adoption to deter deceptive counterfeiters. Eur. J. Oper. Res. 311(1): 373-386 (2023) - 2022
- [j40]Gohram Baloch, Fatma Gzara, Samir Elhedhli:
Covid-19 PPE distribution planning with demand priorities and supply uncertainties. Comput. Oper. Res. 146: 105913 (2022) - [j39]Vedat Bayram, Gohram Baloch, Fatma Gzara, Samir Elhedhli:
Optimal Order Batching in Warehouse Management: A Data-Driven Robust Approach. INFORMS J. Optim. 4(3): 278-303 (2022) - 2021
- [j38]Ahmed Saif, Ali Keyvandarian, Samir Elhedhli:
A new Lagrangian-Benders approach for a concave cost supply chain network design problem. INFOR Inf. Syst. Oper. Res. 59(3): 495-516 (2021) - [j37]Samir Elhedhli, Fatma Gzara, Cynthia Waltho:
Green supply chain design with emission sensitive demand: second order cone programming formulation and case study. Optim. Lett. 15(1): 231-247 (2021) - 2020
- [j36]Fatma Gzara, Samir Elhedhli, Burak Can Yildiz:
The Pallet Loading Problem: Three-dimensional bin packing with practical constraints. Eur. J. Oper. Res. 287(3): 1062-1074 (2020) - [j35]Fatma Gzara, Samir Elhedhli, Ugur Yildiz, Gohram Baloch:
Data-Driven Modeling and Optimization of the Order Consolidation Problem in E-Warehousing. INFORMS J. Optim. 2(4): 273-296 (2020) - [j34]Taghi Khaniyev, Samir Elhedhli, Fatih Safa Erenay:
Spatial Separability in Hub Location Problems with an Application to Brain Connectivity Networks. INFORMS J. Optim. 2(4): 320-346 (2020)
2010 – 2019
- 2019
- [j33]Ahmed Saif, Samir Elhedhli:
Sterilization network design. EURO J. Transp. Logist. 8(1): 91-115 (2019) - [j32]Vedat Bayram, Fatma Gzara, Samir Elhedhli:
Joint capacity, inventory, and demand allocation decisions in manufacturing systems. IISE Trans. 51(3): 248-265 (2019) - [j31]Samir Elhedhli:
CORS 60th anniversary special issue: celebrating recent Canadian contributions to operational research. INFOR Inf. Syst. Oper. Res. 57(4): 495 (2019) - [j30]Samir Elhedhli, Fatma Gzara, Burak Yildiz:
Three-Dimensional Bin Packing and Mixed-Case Palletization. INFORMS J. Optim. 1(4): 323-352 (2019) - 2018
- [j29]Samir Elhedhli, Yan Wang, Ahmed Saif:
Service system design with immobile servers, stochastic demand and concave-cost capacity selection. Comput. Oper. Res. 94: 65-75 (2018) - [j28]Taghi Khaniyev, Samir Elhedhli, Fatih Safa Erenay:
Structure Detection in Mixed-Integer Programs. INFORMS J. Comput. 30(3): 570-587 (2018) - 2017
- [j27]Samir Elhedhli, Zichao Li, James H. Bookbinder:
Airfreight forwarding under system-wide and double discounts. EURO J. Transp. Logist. 6(2): 165-183 (2017) - [j26]Samir Elhedhli, Fatma Gzara, Yi Feng Yan:
A MIP-based slicing heuristic for three-dimensional bin packing. Optim. Lett. 11(8): 1547-1563 (2017) - 2016
- [j25]Ahmed Saif, Samir Elhedhli:
Cold supply chain design with environmental considerations: A simulation-optimization approach. Eur. J. Oper. Res. 251(1): 274-287 (2016) - [j24]Ahmed Saif, Samir Elhedhli:
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem. Optim. Lett. 10(5): 1087-1100 (2016) - 2015
- [j23]James H. Bookbinder, Samir Elhedhli, Zichao Li:
The air-cargo consolidation problem with pivot weight: Models and solution methods. Comput. Oper. Res. 59: 22-32 (2015) - [j22]Samir Elhedhli, Joe Naoum-Sawaya:
Improved branching disjunctions for branch-and-bound: An analytic center approach. Eur. J. Oper. Res. 247(1): 37-45 (2015) - [j21]Samir Elhedhli, Fatma Gzara:
Characterizing the optimality gap and the optimal packings for the bin packing problem. Optim. Lett. 9(2): 209-223 (2015) - 2014
- [j20]Hossa Almutairi, Samir Elhedhli:
Modeling, analysis, and evaluation of a carbon tax policy based on the emission factor. Comput. Ind. Eng. 77: 88-102 (2014) - [j19]Samir Elhedhli, Canan Akdemir, Thomas Åstebro:
Classification models via Tabu search: An application to early stage venture classification. Expert Syst. Appl. 41(18): 8085-8091 (2014) - [j18]Hossa Almutairi, Samir Elhedhli:
Carbon tax based on the emission factor: a bilevel programming approach. J. Glob. Optim. 58(4): 795-815 (2014) - 2013
- [j17]Joe Naoum-Sawaya, Samir Elhedhli:
An interior-point Benders based branch-and-cut algorithm for mixed integer programs. Ann. Oper. Res. 210(1): 33-55 (2013) - [j16]Joe Naoum-Sawaya, Samir Elhedhli:
A stochastic optimization model for real-time ambulance redeployment. Comput. Oper. Res. 40(8): 1972-1978 (2013) - [j15]Muhammad Ismail, Weihua Zhuang, Samir Elhedhli:
Energy and Content Aware Multi-Homing Video Transmission in Heterogeneous Networks. IEEE Trans. Wirel. Commun. 12(7): 3600-3610 (2013) - 2011
- [j14]Joe Naoum-Sawaya, Samir Elhedhli:
An interior point cutting plane heuristic for mixed integer programming. Comput. Oper. Res. 38(9): 1335-1341 (2011) - [j13]Samir Elhedhli, Lingzi Li, Mariem Gzara, Joe Naoum-Sawaya:
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts. INFORMS J. Comput. 23(3): 404-415 (2011) - [j12]Joe Naoum-Sawaya, Samir Elhedhli:
Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach. J. Glob. Optim. 50(2): 345-362 (2011) - 2010
- [j11]Samir Elhedhli, Huyu Wu:
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion. INFORMS J. Comput. 22(2): 282-296 (2010)
2000 – 2009
- 2009
- [j10]Hossa Almutairi, Samir Elhedhli:
A new Lagrangean approach to the pooling problem. J. Glob. Optim. 45(2): 237-257 (2009) - [r2]Samir Elhedhli, Jean-Louis Goffin, Jean-Philippe Vial:
Nondifferentiable Optimization. Encyclopedia of Optimization 2009: 2584-2590 - [r1]Samir Elhedhli, Jean-Louis Goffin, Jean-Philippe Vial:
Nondifferentiable Optimization: Cutting Plane Methods. Encyclopedia of Optimization 2009: 2590-2595 - 2008
- [j9]Saif Benjaafar, Yanzhi Li, Dongsheng Xu, Samir Elhedhli:
Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources. Manuf. Serv. Oper. Manag. 10(1): 43-60 (2008) - 2007
- [j8]Navneet Vidyarthi, Emre Çelebi, Samir Elhedhli, Elizabeth M. Jewkes:
Integrated Production-Inventory-Distribution System Design with Risk Pooling: Model Formulation and Heuristic Solution. Transp. Sci. 41(3): 392-408 (2007) - 2006
- [j7]Thomas Åstebro, Samir Elhedhli:
The Effectiveness of Simple Decision Heuristics: Forecasting Commercial Success for Early-Stage Ventures. Manag. Sci. 52(3): 395-409 (2006) - [j6]Samir Elhedhli:
Service System Design with Immobile Servers, Stochastic Demand, and Congestion. Manuf. Serv. Oper. Manag. 8(1): 92-97 (2006) - 2005
- [j5]Samir Elhedhli, Frank Xiaolong Hu:
Hub-and-spoke network design with congestion. Comput. Oper. Res. 32: 1615-1632 (2005) - [j4]Samir Elhedhli:
Ranking lower bounds for the bin-packing problem. Eur. J. Oper. Res. 160(1): 34-46 (2005) - [j3]Samir Elhedhli, Jean-Louis Goffin:
Efficient Production-Distribution System Design. Manag. Sci. 51(7): 1151-1164 (2005) - [j2]Samir Elhedhli:
Exact solution of a class of nonlinear knapsack problems. Oper. Res. Lett. 33(6): 615-624 (2005) - 2004
- [j1]Samir Elhedhli, Jean-Louis Goffin:
The integration of an interior-point cutting plane method within a branch-and-price algorithm. Math. Program. 100(2): 267-294 (2004)
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 21:21 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:
