Mohamed Haouari
Orcid: 0000-0003-0767-8220
According to our database1,
Mohamed Haouari
authored at least 100 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Int. Trans. Oper. Res., November, 2024
The cost of carrier consistency: Last-mile delivery by vehicle and drone for subscription-based orders.
J. Oper. Res. Soc., May, 2024
Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls.
RAIRO Oper. Res., January, 2024
Lower and upper bounding procedures for the bin packing problem with concave loading cost.
Eur. J. Oper. Res., January, 2024
2023
Comput. Oper. Res., November, 2023
Comput. Oper. Res., September, 2023
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2023
A Mixed-Integer Programming Model for the Container Truck Routing Problem with Net Worth Maximization.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2023
2022
Inf. Process. Manag., 2022
A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem.
Comput. Oper. Res., 2022
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2022
2021
INFORMS J. Comput., 2021
Green hydrogen for industrial sector decarbonization: Costs and impacts on hydrogen economy in qatar.
Comput. Chem. Eng., 2021
2019
An exact approach for the multicommodity network optimization problem with a step cost function.
RAIRO Oper. Res., 2019
CoRR, 2019
An Efficient Algorithm for Dense Network Flow Maximization with Multihop Backhauling and NFPs.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019
On Network Flow Maximization via Multihop Backhauling and UAVs: An Integer Programming Approach.
Proceedings of the 89th IEEE Vehicular Technology Conference, 2019
2018
A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem.
RAIRO Oper. Res., 2018
Discret. Appl. Math., 2018
Proceedings of the International Conference on Information and Communication Technology Convergence, 2018
2017
A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem.
Transp. Sci., 2017
A simulation-optimisation approach for supply chain network design under supply and demand uncertainties.
Int. J. Prod. Res., 2017
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems.
Eur. J. Oper. Res., 2017
Comput. Ind. Eng., 2017
Ann. Oper. Res., 2017
2016
Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations.
INFORMS J. Comput., 2016
Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations.
INFORMS J. Comput., 2016
Ann. Oper. Res., 2016
2015
Eur. J. Oper. Res., 2015
A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem.
Appl. Math. Comput., 2015
Proceedings of the 2015 IEEE International Conference on Industrial Engineering and Engineering Management, 2015
2014
J. Sched., 2014
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures.
Discret. Appl. Math., 2014
2013
An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing.
Transp. Sci., 2013
Transp. Sci., 2013
J. Oper. Res. Soc., 2013
J. Oper. Res. Soc., 2013
Tight compact models and comparative analysis for the prize collecting Steiner tree problem.
Discret. Appl. Math., 2013
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles.
Comput. Oper. Res., 2013
Comput. Oper. Res., 2013
Comput. Ind. Eng., 2013
A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture.
Ann. Oper. Res., 2013
2012
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions.
RAIRO Oper. Res., 2012
Optim. Lett., 2012
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem.
Comput. Oper. Res., 2012
2011
Comput. Optim. Appl., 2011
Comput. Optim. Appl., 2011
Comput. Ind. Eng., 2011
Appl. Math. Comput., 2011
Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011
2010
Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach.
INFORMS J. Comput., 2010
Robust scheduling and robustness measures for the discrete time/cost trade-off problem.
Eur. J. Oper. Res., 2010
Eur. J. Oper. Res., 2010
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem.
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint.
Electron. Notes Discret. Math., 2010
Discret. Optim., 2010
Comput. Oper. Res., 2010
Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version.
Comput. Oper. Res., 2010
2009
Int. J. Adv. Oper. Manag., 2009
Eur. J. Oper. Res., 2009
Approximation algorithms for single machine scheduling with one unavailability period.
4OR, 2009
2008
J. Sched., 2008
Int. Trans. Oper. Res., 2008
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches.
Comput. Optim. Appl., 2008
A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling.
Comput. Ind. Eng., 2008
Appl. Math. Comput., 2008
2007
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements.
Optim. Lett., 2007
J. Oper. Res. Soc., 2007
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails.
Comput. Oper. Res., 2007
2006
Int. Trans. Oper. Res., 2006
Upper and lower bounding strategies for the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2006
Comput. Oper. Res., 2006
2005
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm.
J. Oper. Res. Soc., 2005
Discret. Appl. Math., 2005
A computational study of the permutation flow shop problem based on a tight lower bound.
Comput. Oper. Res., 2005
2004
Ann. Oper. Res., 2004
2003
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines.
Oper. Res. Lett., 2003
J. Oper. Res. Soc., 2003
Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem.
J. Exp. Theor. Artif. Intell., 2003
2002
A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem.
J. Oper. Res. Soc., 2002
2001
2000
1999
1997
Oper. Res. Lett., 1997