Mohamed Haouari

According to our database1, Mohamed Haouari authored at least 89 papers between 1997 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Parcel delivery by vehicle and drone.
J. Oper. Res. Soc., 2021

Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem.
INFORMS J. Comput., 2021

Green hydrogen for industrial sector decarbonization: Costs and impacts on hydrogen economy in qatar.
Comput. Chem. Eng., 2021

2019
A New Compact Formulation for the Daily Crew Pairing Problem.
Transp. Sci., 2019

An exact approach for the multicommodity network optimization problem with a step cost function.
RAIRO Oper. Res., 2019

A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem.
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

A matheuristic for the asymmetric capacitated vehicle routing problem.
Discret. Appl. Math., 2018

Maximizing Dense Network Flow through Wireless Multihop Backhauling using UAVs.
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

A two-level optimization approach for robust aircraft routing and retiming.
Comput. Ind. Eng., 2017

Solving a large-scale integrated fleet assignment and crew pairing problem.
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

An optimization-based heuristic for the machine reassignment problem.
Ann. Oper. Res., 2016

2015
Solving a large-scale crew pairing problem.
J. Oper. Res. Soc., 2015

Optimization models for a single-plant District Cooling System.
Eur. J. Oper. Res., 2015

A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem.
Appl. Math. Comput., 2015

A PSO approach for robust aircraft routing.
Proceedings of the 2015 IEEE International Conference on Industrial Engineering and Engineering Management, 2015

2014
A preemptive bound for the Resource Constrained Project Scheduling Problem.
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

A Lifted Compact Formulation for the Daily Aircraft Maintenance Routing Problem.
Transp. Sci., 2013

A branch-and-price algorithm for the two-stage guillotine cutting stock problem.
J. Oper. Res. Soc., 2013

MIP models for minimizing total tardiness in a two-machine flow shop.
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

An assignment-based lower bound for a class of two-machine flow shop problems.
Comput. Oper. Res., 2013

Improved bounds for hybrid flow shop scheduling with multiprocessor tasks.
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

A branch-and-cut algorithm for the Steiner tree problem with delays.
Optim. Lett., 2012

Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem.
Comput. Oper. Res., 2012

2011
Flexible aircraft fleeting and routing at <i>TunisAir</i>.
J. Oper. Res. Soc., 2011

Exact approaches for integrated aircraft fleeting and routing at TunisAir.
Comput. Optim. Appl., 2011

Relaxations and exact solution of the variable sized bin packing problem.
Comput. Optim. Appl., 2011

Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search.
Comput. Ind. Eng., 2011

Bounding strategies for the hybrid flow shop scheduling problem.
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

An optimization-based heuristic for the robotic cell problem.
Eur. J. Oper. Res., 2010

A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem.
Electron. Notes Discret. Math., 2010

An Exact Algorithm for the Steiner Tree Problem with Delays.
Electron. Notes Discret. Math., 2010

IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem.
Electron. Notes Discret. Math., 2010

Exact Method for Robotic Cell Problem.
Electron. Notes Discret. Math., 2010

Climbing discrepancy search for flowshop and jobshop scheduling with time lags.
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

Robust Aircraft Routing and Flight Retiming.
Electron. Notes Discret. Math., 2010

Algorithmic expedients for the Prize Collecting Steiner Tree Problem.
Discret. Optim., 2010

Discrepancy search for the flexible job shop scheduling problem.
Comput. Oper. Res., 2010

Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version.
Comput. Oper. Res., 2010

2009
Scheduling on parallel identical machines to minimise the total weighted tardiness.
Int. J. Adv. Oper. Manag., 2009

Network flow-based approaches for integrated aircraft fleeting and routing.
Eur. J. Oper. Res., 2009

Heuristics for the variable sized bin-packing problem.
Comput. Oper. Res., 2009

Approximation algorithms for single machine scheduling with one unavailability period.
4OR, 2009

2008
Energetic reasoning revisited: application to parallel machine scheduling.
J. Sched., 2008

Tight bounds for the identical parallel machine-scheduling problem: Part II.
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

Optimal solution of the discrete cost multicommodity network design problem.
Appl. Math. Comput., 2008

Maximizing the minimum completion time on parallel machines.
4OR, 2008

2007
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements.
Optim. Lett., 2007

Minimizing maximum lateness in a flow shop subject to release dates.
J. Oper. Res. Soc., 2007

An approximate decomposition algorithm for scheduling on parallel machines with heads and tails.
Comput. Oper. Res., 2007

Supplier selection and order lot sizing modeling: A review.
Comput. Oper. Res., 2007

2006
Optimal Scheduling of a Two-stage Hybrid Flow Shop.
Math. Methods Oper. Res., 2006

Tight bounds for the identical parallel machine scheduling problem.
Int. Trans. Oper. Res., 2006

Upper and lower bounding strategies for the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2006

A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem.
Comput. Oper. Res., 2006

2005
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm.
J. Oper. Res. Soc., 2005

Fast lifting procedures for the bin packing problem.
Discret. Optim., 2005

Optimal parallel machines scheduling with availability constraints.
Discret. Appl. Math., 2005

A computational study of the permutation flow shop problem based on a tight lower bound.
Comput. Oper. Res., 2005

2004
Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails.
Ann. Oper. Res., 2004

2003
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines.
Oper. Res. Lett., 2003

A branch-and-bound-based local search method for the flow shop problem.
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
Optimal cropping patterns under water deficits.
Eur. J. Oper. Res., 2001

2000
Minimising maximum lateness in a two-machine flowshop.
J. Oper. Res. Soc., 2000

Generalized Steiner Problems and Other Variants.
J. Comb. Optim., 2000

Generalized spanning trees.
Eur. J. Oper. Res., 2000

1999
Optimal scheduling of the 3-machine assembly-type flow shop.
RAIRO Oper. Res., 1999

1997
Heuristic algorithms for the two-stage hybrid flowshop problem.
Oper. Res. Lett., 1997


  Loading...