default search action
Hakim Akeb
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Hakim Akeb
, Aldo Lévy, Mohamed Rdali:
A quantitative method for opinion ratings and analysis: an event study. Ann. Oper. Res. 313(2): 625-638 (2022)
2010 – 2019
- 2014
- [c4]Hakim Akeb:
A Look-Forward Heuristic for Packing Spheres into a Three-Dimensional Bin. FedCSIS 2014: 397-404 - 2013
- [j8]Hakim Akeb
Solving the circular open dimension problem by using separate beams and look-ahead strategies. Comput. Oper. Res. 40(5): 1243-1255 (2013) - [c3]Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi:
A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows. WCO@FedCSIS 2013: 1-19 - [c2]Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi:
A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows. FedCSIS 2013: 329-336 - [p1]Hakim Akeb, Mhand Hifi, Dominique Lazure:
A Heuristic Based Algorithm for the 2D Circular Strip Packing Problem. Recent Advances in Computational Optimization 2013: 73-92 - 2012
- [c1]Hakim Akeb, Mhand Hifi, Dominique Lazure:
An Improved Algorithm for the Strip Packing Problem. FedCSIS 2012: 357-364 - 2011
- [j7]Hakim Akeb
Local branching-based algorithms for the disjunctively constrained knapsack problem. Comput. Ind. Eng. 60(4): 811-820 (2011) - [j6]Hakim Akeb
An augmented beam search-based algorithm for the circular open dimension problem. Comput. Ind. Eng. 61(2): 373-381 (2011) - 2010
- [j5]Hakim Akeb
Adaptive beam search lookahead algorithms for the circular packing problem. Int. Trans. Oper. Res. 17(5): 553-575 (2010) - [j4]Hakim Akeb
A hybrid beam search looking-ahead algorithm for the circular packing problem. J. Comb. Optim. 20(2): 101-130 (2010)
2000 – 2009
- 2009
- [j3]Hakim Akeb
A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36(5): 1513-1528 (2009) - 2008
- [j2]Hakim Akeb
Algorithms for the circular two-dimensional open dimension problem. Int. Trans. Oper. Res. 15(6): 685-704 (2008) - 2005
- [j1]Wenqi Huang, Yu Li, Hakim Akeb
Greedy algorithms for packing unequal circles into a rectangular container. J. Oper. Res. Soc. 56(5): 539-548 (2005)
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-24 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: