Samir Elhedhli

According to our database1, Samir Elhedhli authored at least 34 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




The Pallet Loading Problem: Three-dimensional bin packing with practical constraints.
Eur. J. Oper. Res., 2020

CORS 60th anniversary special issue: celebrating recent Canadian contributions to operational research.
INFOR Inf. Syst. Oper. Res., 2019

Sterilization network design.
EURO J. Transp. Logist., 2019

Structure Detection in Mixed-Integer Programs.
INFORMS J. Comput., 2018

Service system design with immobile servers, stochastic demand and concave-cost capacity selection.
Comput. Oper. Res., 2018

A MIP-based slicing heuristic for three-dimensional bin packing.
Optim. Lett., 2017

Airfreight forwarding under system-wide and double discounts.
EURO J. Transp. Logist., 2017

A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem.
Optim. Lett., 2016

Cold supply chain design with environmental considerations: A simulation-optimization approach.
Eur. J. Oper. Res., 2016

Characterizing the optimality gap and the optimal packings for the bin packing problem.
Optim. Lett., 2015

Improved branching disjunctions for branch-and-bound: An analytic center approach.
Eur. J. Oper. Res., 2015

The air-cargo consolidation problem with pivot weight: Models and solution methods.
Comput. Oper. Res., 2015

Carbon tax based on the emission factor: a bilevel programming approach.
J. Glob. Optim., 2014

Classification models via Tabu search: An application to early stage venture classification.
Expert Syst. Appl., 2014

Modeling, analysis, and evaluation of a carbon tax policy based on the emission factor.
Comput. Ind. Eng., 2014

Energy and Content Aware Multi-Homing Video Transmission in Heterogeneous Networks.
IEEE Trans. Wirel. Commun., 2013

A stochastic optimization model for real-time ambulance redeployment.
Comput. Oper. Res., 2013

An interior-point Benders based branch-and-cut algorithm for mixed integer programs.
Ann. Oper. Res., 2013

Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach.
J. Glob. Optim., 2011

A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts.
INFORMS J. Comput., 2011

An interior point cutting plane heuristic for mixed integer programming.
Comput. Oper. Res., 2011

A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion.
INFORMS J. Comput., 2010

Nondifferentiable Optimization: Cutting Plane Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nondifferentiable Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A new Lagrangean approach to the pooling problem.
J. Glob. Optim., 2009

Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources.
Manuf. Serv. Oper. Manag., 2008

Integrated Production-Inventory-Distribution System Design with Risk Pooling: Model Formulation and Heuristic Solution.
Transp. Sci., 2007

Service System Design with Immobile Servers, Stochastic Demand, and Congestion.
Manuf. Serv. Oper. Manag., 2006

The Effectiveness of Simple Decision Heuristics: Forecasting Commercial Success for Early-Stage Ventures.
Manag. Sci., 2006

Exact solution of a class of nonlinear knapsack problems.
Oper. Res. Lett., 2005

Efficient Production-Distribution System Design.
Manag. Sci., 2005

Ranking lower bounds for the bin-packing problem.
Eur. J. Oper. Res., 2005

Hub-and-spoke network design with congestion.
Comput. Oper. Res., 2005

The integration of an interior-point cutting plane method within a branch-and-price algorithm.
Math. Program., 2004