default search action
Mohamed Haouari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j90]Mohamed Haouari, Mariem Mhiri:
Lower and upper bounding procedures for the bin packing problem with concave loading cost. Eur. J. Oper. Res. 312(1): 56-69 (2024) - [j89]Mariem Mhiri, Karim Al-Yafi, Benjamin Legros, Oualid Jouini, Mohamed Haouari:
A blockchain-based framework to optimize shipping container flows in the hinterland. Int. Trans. Oper. Res. 31(6): 3808-3841 (2024) - [j88]Amro M. El-Adle, Ahmed Ghoniem, Mohamed Haouari:
The cost of carrier consistency: Last-mile delivery by vehicle and drone for subscription-based orders. J. Oper. Res. Soc. 75(5): 821-840 (2024) - 2023
- [j87]Tulay Flamand, Manuel Iori, Mohamed Haouari:
The transportation problem with packing constraints. Comput. Oper. Res. 157: 106278 (2023) - [j86]Amro M. El-Adle, Ahmed Ghoniem, Mohamed Haouari:
A variable neighborhood search for parcel delivery by vehicle with drone cycles. Comput. Oper. Res. 159: 106319 (2023) - [c8]Maryam Al Khatib, Mohamed Kharbeche, Mohamed Haouari:
A General Framework for Building Resilient Global Supply Chains. IEEM 2023: 437-442 - [c7]Mohamed Haouari, Mariem Mhiri:
A Mixed-Integer Programming Model for the Container Truck Routing Problem with Net Worth Maximization. IEEM 2023: 722-726 - 2022
- [j85]Mohamed Ben Ahmed, Maryia Hryhoryeva, Lars Magnus Hvattum, Mohamed Haouari:
A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem. Comput. Oper. Res. 137: 105551 (2022) - [j84]Mohamed Haouari, Mariem Mhiri, Mazen El-Masri, Karim Al-Yafi:
A novel proof of useful work for a blockchain storing transportation transactions. Inf. Process. Manag. 59(1): 102749 (2022) - [c6]Anas Tammam Aljundi, Maryam Al Khatib, Mohamed Kharbeche, Mohamed Haouari:
Solving a Bus Routing Problem Arising in Doha. IEEM 2022: 600-604 - 2021
- [j83]Monzure-Khoda Kazi, Fadwa T. Eljack, Mahmoud M. El-Halwagi, Mohamed Haouari:
Green hydrogen for industrial sector decarbonization: Costs and impacts on hydrogen economy in qatar. Comput. Chem. Eng. 145: 107144 (2021) - [j82]Jean-François Côté, Mohamed Haouari, Manuel Iori:
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem. INFORMS J. Comput. 33(3): 963-978 (2021) - [j81]Amro M. El-Adle, Ahmed Ghoniem, Mohamed Haouari:
Parcel delivery by vehicle and drone. J. Oper. Res. Soc. 72(2): 398-416 (2021)
2010 – 2019
- 2019
- [j80]Imen Mejri, Mohamed Haouari, Safa Bhar Layeb, Farah Zeghal Mansour:
An exact approach for the multicommodity network optimization problem with a step cost function. RAIRO Oper. Res. 53(4): 1279-1295 (2019) - [j79]Mohamed Haouari, Farah Zeghal Mansour, Hanif D. Sherali:
A New Compact Formulation for the Daily Crew Pairing Problem. Transp. Sci. 53(3): 811-828 (2019) - [c5]Abdullateef Almohamad, Mazen O. Hasna, Tamer Khattab, Mohamed Haouari:
On Network Flow Maximization via Multihop Backhauling and UAVs: An Integer Programming Approach. VTC Spring 2019: 1-6 - [c4]Abdullateef Almohamad, Mazen O. Hasna, Tamer Khattab, Mohamed Haouari:
An Efficient Algorithm for Dense Network Flow Maximization with Multihop Backhauling and NFPs. VTC Fall 2019: 1-5 - [i2]Jean-François Côté, Mohamed Haouari, Manuel Iori:
A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem. CoRR abs/1909.06835 (2019) - 2018
- [j78]Valeria Leggieri, Mohamed Haouari:
A matheuristic for the asymmetric capacitated vehicle routing problem. Discret. Appl. Math. 234: 139-150 (2018) - [j77]Mehdi Serairi, Mohamed Haouari:
A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem. RAIRO Oper. Res. 52(2): 391 (2018) - [c3]Abdullateef Almohamad, Mazen O. Hasna, Tamer Khattab, Mohamed Haouari:
Maximizing Dense Network Flow through Wireless Multihop Backhauling using UAVs. ICTC 2018: 526-531 - 2017
- [j76]Okan Örsan Özener, Melda Ormeci Matoglu, Günes Erdogan, Mohamed Haouari, Hasan Sözer:
Solving a large-scale integrated fleet assignment and crew pairing problem. Ann. Oper. Res. 253(1): 477-500 (2017) - [j75]Mohamed Ben Ahmed, Farah Zeghal Mansour, Mohamed Haouari:
A two-level optimization approach for robust aircraft routing and retiming. Comput. Ind. Eng. 112: 586-594 (2017) - [j74]Valeria Leggieri, Mohamed Haouari:
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems. Eur. J. Oper. Res. 263(3): 755-767 (2017) - [j73]Roba W. Salem, Mohamed Haouari:
A simulation-optimisation approach for supply chain network design under supply and demand uncertainties. Int. J. Prod. Res. 55(7): 1845-1861 (2017) - [j72]Shengzhi Shao, Hanif D. Sherali, Mohamed Haouari:
A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem. Transp. Sci. 51(1): 233-249 (2017) - 2016
- [j71]Mehdi Mrad, Anis Gharbi, Mohamed Haouari, Mohamed Kharbeche:
An optimization-based heuristic for the machine reassignment problem. Ann. Oper. Res. 242(1): 115-132 (2016) - [j70]Ahmed Ghoniem, Tulay Flamand, Mohamed Haouari:
Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations. INFORMS J. Comput. 28(3): 575-588 (2016) - [j69]Ahmed Ghoniem, Tulay Flamand, Mohamed Haouari:
Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations. INFORMS J. Comput. 28(3): 589-602 (2016) - 2015
- [j68]Samer S. Said, Mohamed Haouari:
A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem. Appl. Math. Comput. 259: 628-636 (2015) - [j67]Reem Khir, Mohamed Haouari:
Optimization models for a single-plant District Cooling System. Eur. J. Oper. Res. 247(2): 648-658 (2015) - [j66]Günes Erdogan, Mohamed Haouari, Melda Ormeci Matoglu, Okan Örsan Özener:
Solving a large-scale crew pairing problem. J. Oper. Res. Soc. 66(10): 1742-1754 (2015) - [c2]Mohamed Ben Ahmed, Farah Zeghal Mansour, Mohamed Haouari:
A PSO approach for robust aircraft routing. IEEM 2015: 219-223 - 2014
- [j65]Valeria Leggieri, Mohamed Haouari, Chefi Triki:
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures. Discret. Appl. Math. 164: 178-190 (2014) - [j64]Mohamed Haouari, Anis Kooli, Emmanuel Néron, Jacques Carlier:
A preemptive bound for the Resource Constrained Project Scheduling Problem. J. Sched. 17(3): 237-248 (2014) - 2013
- [j63]Hanif D. Sherali, Ki-Hwan Bae, Mohamed Haouari:
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. 210(1): 213-244 (2013) - [j62]Asma Lahimer, Pierre Lopez, Mohamed Haouari:
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks. Comput. Ind. Eng. 66(4): 1106-1114 (2013) - [j61]Mohamed Haouari, Mohamed Kharbeche:
An assignment-based lower bound for a class of two-machine flow shop problems. Comput. Oper. Res. 40(7): 1693-1699 (2013) - [j60]Mohamed Haouari, Nelson Maculan, Mehdi Mrad:
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles. Comput. Oper. Res. 40(10): 2485-2492 (2013) - [j59]Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
Tight compact models and comparative analysis for the prize collecting Steiner tree problem. Discret. Appl. Math. 161(4-5): 618-632 (2013) - [j58]Mehdi Mrad, I. Meftahi, Mohamed Haouari:
A branch-and-price algorithm for the two-stage guillotine cutting stock problem. J. Oper. Res. Soc. 64(5): 629-637 (2013) - [j57]Mohamed Kharbeche, Mohamed Haouari:
MIP models for minimizing total tardiness in a two-machine flow shop. J. Oper. Res. Soc. 64(5): 690-707 (2013) - [j56]Hanif D. Sherali, Ki-Hwan Bae, Mohamed Haouari:
An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing. Transp. Sci. 47(4): 455-476 (2013) - [j55]Mohamed Haouari, Shengzhi Shao, Hanif D. Sherali:
A Lifted Compact Formulation for the Daily Aircraft Maintenance Routing Problem. Transp. Sci. 47(4): 508-525 (2013) - 2012
- [j54]Mohamed Haouari, Anis Kooli, Emmanuel Néron:
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. Comput. Oper. Res. 39(5): 1187-1194 (2012) - [j53]Valeria Leggieri, Mohamed Haouari, Chefi Triki:
A branch-and-cut algorithm for the Steiner tree problem with delays. Optim. Lett. 6(8): 1753-1771 (2012) - [j52]Imed Kacem, Nizar Souayah, Mohamed Haouari:
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. RAIRO Oper. Res. 46(2): 125-147 (2012) - 2011
- [j51]Lotfi Hidri, Mohamed Haouari:
Bounding strategies for the hybrid flow shop scheduling problem. Appl. Math. Comput. 217(21): 8248-8263 (2011) - [j50]Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez:
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search. Comput. Ind. Eng. 60(2): 320-327 (2011) - [j49]Mohamed Haouari, Mehdi Serairi:
Relaxations and exact solution of the variable sized bin packing problem. Comput. Optim. Appl. 48(2): 345-368 (2011) - [j48]Mohamed Haouari, Hanif D. Sherali, Farah Zeghal Mansour, Najla Aissaoui:
Exact approaches for integrated aircraft fleeting and routing at TunisAir. Comput. Optim. Appl. 49(2): 213-239 (2011) - [j47]Farah Zeghal Mansour, Mohamed Haouari, Hanif D. Sherali, Najla Aissaoui:
Flexible aircraft fleeting and routing at TunisAir. J. Oper. Res. Soc. 62(2): 368-380 (2011) - [c1]Asma Lahimer, Pierre Lopez, Mohamed Haouari:
Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks. CPAIOR 2011: 117-130 - [i1]Asma Lahimer, Pierre Lopez, Mohamed Haouari:
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks. CoRR abs/1103.1516 (2011) - 2010
- [j46]Öncü Hazir, Mohamed Haouari, Erdal Erel:
Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version. Comput. Oper. Res. 37(4): 649-655 (2010) - [j45]Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez:
Discrepancy search for the flexible job shop scheduling problem. Comput. Oper. Res. 37(12): 2192-2201 (2010) - [j44]Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
Algorithmic expedients for the Prize Collecting Steiner Tree Problem. Discret. Optim. 7(1-2): 32-47 (2010) - [j43]Valeria Leggieri, Mohamed Haouari, Chefi Triki:
An Exact Algorithm for the Steiner Tree Problem with Delays. Electron. Notes Discret. Math. 36: 223-230 (2010) - [j42]Anis Kooli, Mohamed Haouari, Lotfi Hidri, Emmanuel Néron:
IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem. Electron. Notes Discret. Math. 36: 359-366 (2010) - [j41]Mohamed Ali Aloulou, Mohamed Haouari, Farah Zeghal Mansour:
Robust Aircraft Routing and Flight Retiming. Electron. Notes Discret. Math. 36: 367-374 (2010) - [j40]Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint. Electron. Notes Discret. Math. 36: 495-502 (2010) - [j39]Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari:
Climbing discrepancy search for flowshop and jobshop scheduling with time lags. Electron. Notes Discret. Math. 36: 821-828 (2010) - [j38]Mohamed Kharbeche, Jacques Carlier, Mohamed Haouari, Aziz Moukrim:
Exact Method for Robotic Cell Problem. Electron. Notes Discret. Math. 36: 859-866 (2010) - [j37]Mehdi Serairi, Mohamed Haouari:
A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem. Electron. Notes Discret. Math. 36: 891-897 (2010) - [j36]Jacques Carlier, Mohamed Haouari, Mohamed Kharbeche, Aziz Moukrim:
An optimization-based heuristic for the robotic cell problem. Eur. J. Oper. Res. 202(3): 636-645 (2010) - [j35]Öncü Hazir, Mohamed Haouari, Erdal Erel:
Robust scheduling and robustness measures for the discrete time/cost trade-off problem. Eur. J. Oper. Res. 207(2): 633-643 (2010) - [j34]Hanif D. Sherali, Ki-Hwan Bae, Mohamed Haouari:
Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach. INFORMS J. Comput. 22(4): 500-513 (2010)
2000 – 2009
- 2009
- [j33]Imed Kacem, Mohamed Haouari:
Approximation algorithms for single machine scheduling with one unavailability period. 4OR 7(1): 79-92 (2009) - [j32]Mohamed Haouari, Mehdi Serairi:
Heuristics for the variable sized bin-packing problem. Comput. Oper. Res. 36(10): 2877-2884 (2009) - [j31]Mohamed Haouari, Najla Aissaoui, Farah Zeghal Mansour:
Network flow-based approaches for integrated aircraft fleeting and routing. Eur. J. Oper. Res. 193(2): 591-599 (2009) - [j30]Nizar Souayah, Imed Kacem, Mohamed Haouari, Chengbin Chu:
Scheduling on parallel identical machines to minimise the total weighted tardiness. Int. J. Adv. Oper. Manag. 1(1): 30-69 (2009) - 2008
- [j29]Mohamed Haouari, Mahdi Jemmali:
Maximizing the minimum completion time on parallel machines. 4OR 6(4): 375-392 (2008) - [j28]Mehdi Mrad, Mohamed Haouari:
Optimal solution of the discrete cost multicommodity network design problem. Appl. Math. Comput. 204(2): 745-753 (2008) - [j27]Hédi Chtourou, Mohamed Haouari:
A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling. Comput. Ind. Eng. 55(1): 183-194 (2008) - [j26]Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches. Comput. Optim. Appl. 40(1): 13-39 (2008) - [j25]Mohamed Haouari, Mahdi Jemmali:
Tight bounds for the identical parallel machine-scheduling problem: Part II. Int. Trans. Oper. Res. 15(1): 19-34 (2008) - [j24]Lotfi Hidri, Anis Gharbi, Mohamed Haouari:
Energetic reasoning revisited: application to parallel machine scheduling. J. Sched. 11(4): 239-252 (2008) - 2007
- [j23]Anis Gharbi, Mohamed Haouari:
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Comput. Oper. Res. 34(3): 868-883 (2007) - [j22]Najla Aissaoui, Mohamed Haouari, Elkafi Hassini:
Supplier selection and order lot sizing modeling: A review. Comput. Oper. Res. 34(12): 3516-3540 (2007) - [j21]Mohamed Haouari, Talel Ladhari:
Minimizing maximum lateness in a flow shop subject to release dates. J. Oper. Res. Soc. 58(1): 62-72 (2007) - [j20]Mohamed Haouari, Mehdi Mrad, Hanif D. Sherali:
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements. Optim. Lett. 1(4): 341-354 (2007) - 2006
- [j19]Mohamed Haouari, Jouhaina Chaouachi Siala:
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. Comput. Oper. Res. 33: 1274-1288 (2006) - [j18]Mohamed Haouari, Jouhaina Chaouachi Siala:
Upper and lower bounding strategies for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 171(2): 632-647 (2006) - [j17]Mohamed Haouari, Anis Gharbi, Mahdi Jemmali:
Tight bounds for the identical parallel machine scheduling problem. Int. Trans. Oper. Res. 13(6): 529-548 (2006) - [j16]Mohamed Haouari, Lotfi Hidri, Anis Gharbi:
Optimal Scheduling of a Two-stage Hybrid Flow Shop. Math. Methods Oper. Res. 64(1): 107-124 (2006) - 2005
- [j15]Talel Ladhari, Mohamed Haouari:
A computational study of the permutation flow shop problem based on a tight lower bound. Comput. Oper. Res. 32: 1831-1847 (2005) - [j14]Anis Gharbi, Mohamed Haouari:
Optimal parallel machines scheduling with availability constraints. Discret. Appl. Math. 148(1): 63-87 (2005) - [j13]Mohamed Haouari, Anis Gharbi:
Fast lifting procedures for the bin packing problem. Discret. Optim. 2(3): 201-218 (2005) - [j12]Mohamed Haouari, Jouhaina Chaouachi, Moshe Dror:
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. J. Oper. Res. Soc. 56(4): 382-389 (2005) - 2004
- [j11]Mohamed Haouari, Anis Gharbi:
Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails. Ann. Oper. Res. 129(1-4): 187-204 (2004) - 2003
- [j10]Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin, Mohamed Haouari:
Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem. J. Exp. Theor. Artif. Intell. 15(1): 103-112 (2003) - [j9]Mohamed Haouari, Talel Ladhari:
A branch-and-bound-based local search method for the flow shop problem. J. Oper. Res. Soc. 54(10): 1076-1084 (2003) - [j8]Mohamed Haouari, Anis Gharbi:
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. Oper. Res. Lett. 31(1): 49-52 (2003) - 2002
- [j7]Mohamed Haouari, Jouhaina Chaouachi:
A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem. J. Oper. Res. Soc. 53(7): 792-799 (2002) - 2001
- [j6]Mohamed Haouari, Mohamed Naceur Azaiez:
Optimal cropping patterns under water deficits. Eur. J. Oper. Res. 130(1): 133-146 (2001) - 2000
- [j5]Moshe Dror, Mohamed Haouari, Jouhaina Chaouachi Siala:
Generalized spanning trees. Eur. J. Oper. Res. 120(3): 583-592 (2000) - [j4]Moshe Dror, Mohamed Haouari:
Generalized Steiner Problems and Other Variants. J. Comb. Optim. 4(4): 415-436 (2000) - [j3]Mohamed Haouari, Talel Ladhari:
Minimising maximum lateness in a two-machine flowshop. J. Oper. Res. Soc. 51(9): 1100-1106 (2000)
1990 – 1999
- 1999
- [j2]Mohamed Haouari, Thouraya Daouas:
Optimal scheduling of the 3-machine assembly-type flow shop. RAIRO Oper. Res. 33(4): 439-445 (1999) - 1997
- [j1]Mohamed Haouari, Rym M'Hallah:
Heuristic algorithms for the two-stage hybrid flowshop problem. Oper. Res. Lett. 21(1): 43-53 (1997)
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:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint