default search action
Khaled Hadj-Hamou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2002
- [b1]Khaled Hadj-Hamou:
Contribution à la conception de produits à forte diversité et de leur chaine logistique : une approche par contraintes. (Contribution to the design of products with large diversity and their supply chain: a constraint based approach). National Polytechnic Institute of Toulouse, France, 2002
Journal Articles
- 2022
- [j16]Faycal A. Touzout, Anne-Laure Ladier, Khaled Hadj-Hamou:
An assign-and-route matheuristic for the time-dependent inventory routing problem. Eur. J. Oper. Res. 300(3): 1081-1097 (2022) - 2021
- [j15]Aymen Aloui, Khaled Hadj-Hamou:
A heuristic approach for a scheduling problem in additive manufacturing under technological constraints. Comput. Ind. Eng. 154: 107115 (2021) - [j14]Faycal A. Touzout, Anne-Laure Ladier, Khaled Hadj-Hamou:
Modelling and comparison of stability metrics for a re-optimisation approach of the Inventory Routing Problem under demand uncertainty. EURO J. Transp. Logist. 10: 100050 (2021) - [j13]Wouter Lefever, Faycal A. Touzout, Khaled Hadj-Hamou, El-Houssaine Aghezzaf:
Benders' decomposition for robust travel time-constrained inventory routing problem. Int. J. Prod. Res. 59(2): 342-366 (2021) - [j12]Katyanne Farias, Khaled Hadj-Hamou, Claude Yugma:
Model and exact solution for a two-echelon inventory routing problem. Int. J. Prod. Res. 59(10): 3109-3132 (2021) - 2018
- [j11]Akram Chergui, Khaled Hadj-Hamou, Frédéric Vignat:
Production scheduling and nesting in additive manufacturing. Comput. Ind. Eng. 126: 292-301 (2018) - [j10]Wouter Lefever, El-Houssaine Aghezzaf, Khaled Hadj-Hamou, Bernard Penz:
Analysis of an improved branch-and-cut formulation for the Inventory-Routing Problem with Transshipment. Comput. Oper. Res. 98: 137-148 (2018) - 2016
- [j9]Wouter Lefever, El-Houssaine Aghezzaf, Khaled Hadj-Hamou:
A convex optimization approach for solving the single-vehicle cyclic inventory routing problem. Comput. Oper. Res. 72: 97-106 (2016) - 2013
- [j8]Issam Mazhoud, Khaled Hadj-Hamou, Jean Bigeon, Patrice Joyeux:
Particle swarm optimization for solving engineering problems: A new constraint-handling mechanism. Eng. Appl. Artif. Intell. 26(4): 1263-1273 (2013) - [j7]Muhammad Kashif Shahzad, Khaled Hadj-Hamou:
Integrated supply chain and product family architecture under highly customized demand. J. Intell. Manuf. 24(5): 1005-1018 (2013) - 2012
- [j6]Issam Mazhoud, Khaled Hadj-Hamou, Jean Bigeon, Ghislain Remy:
Interval-based global optimization in engineering using model reformulation and constraint propagation. Eng. Appl. Artif. Intell. 25(2): 404-417 (2012) - 2010
- [j5]Mohsen Sadeghi, Khaled Hadj-Hamou, Frédéric Noël:
A collaborative platform architecture for coherence management in multi-view integrated product modelling. Int. J. Comput. Integr. Manuf. 23(3): 270-282 (2010) - [j4]Mohsen Sadeghi, Frédéric Noël, Khaled Hadj-Hamou:
Development of control mechanisms to support coherency of product model during cooperative design process. J. Intell. Manuf. 21(4): 539-554 (2010) - 2008
- [j3]Michel Aldanondo, Élise Vareilles, Khaled Hadj-Hamou, Paul Gaborit:
Aiding design with constraints: an extension of quad trees in order to deal with piecewise functions. Int. J. Comput. Integr. Manuf. 21(4): 353-365 (2008) - 2006
- [j2]Jacques Lamothe, Khaled Hadj-Hamou, Michel Aldanondo:
An optimization model for selecting a product family and designing its supply chain. Eur. J. Oper. Res. 169(3): 1030-1047 (2006) - 2003
- [j1]Michel Aldanondo, Khaled Hadj-Hamou, Guillaume Moynard, Jacques Lamothe:
Mass customization and configuration: Requirement analysis and constraint based modeling propositions. Integr. Comput. Aided Eng. 10(2): 177-189 (2003)
Conference and Workshop Papers
- 2021
- [c7]Minh Tam Tran, Yacine Rekik, Khaled Hadj-Hamou:
Pricing Decisions for an Omnichannel Retailing Under Service Level Considerations. APMS (3) 2021: 175-185 - 2020
- [c6]Faycal A. Touzout, Anne-Laure Ladier, Khaled Hadj-Hamou:
Time-Dependent Travel-Time Constrained Inventory Routing Problem. ICCL 2020: 151-166 - 2012
- [c5]Issam Mazhoud, Khaled Hadj-Hamou, Jean Bigeon, Patrice Joyeux:
Particle swarm optimization for dynamic analytical models involving Ordinary Differential Equations. CCECE 2012: 1-4 - [c4]Laura Picheral, Khaled Hadj-Hamou, Ghislain Remy, Jean Bigeon:
Optimization based on parameter moments estimation for robust design. CCECE 2012: 1-4 - 2008
- [c3]Mohsen Sadeghi, Khaled Hadj-Hamou, Mickaël Gardoni:
Methods for Analyzing Information Contained in an Enterprise Email Database. CSICC 2008: 509-517 - 2006
- [c2]Michel Aldanondo, Élise Vareilles, Khaled Hadj-Hamou, Paul Gaborit:
A constraint based approach for aiding heat treatment operation design and distortion evaluation. AIAI 2006: 254-261 - 2004
- [c1]Élise Vareilles, Michel Aldanondo, Khaled Hadj-Hamou, Paul Gaborit:
Application des techniques CSP pour la configuration d'un process de traitement thermique. JFPLC 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-12-09 23:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint