default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFayez F. Boctor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j25]Fayez F. Boctor:
Single-machine capacitated lot-sizing and scheduling with delivery dates and quantities. Int. J. Prod. Res. 60(24): 7345-7359 (2022)
2010 – 2019
- 2019
- [j24]Fayez F. Boctor:
The cold rolling mill scheduling problem: Some solution methods. Comput. Ind. Eng. 136: 316-324 (2019) - 2018
- [j23]Fayez F. Boctor, Marie-Claude Bolduc:
The inventory replenishment planning and staggering problem: a bi-objective approach. 4OR 16(2): 199-224 (2018) - [j22]Roubila Lilia Kadri, Fayez F. Boctor:
An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case. Eur. J. Oper. Res. 265(2): 454-462 (2018) - 2012
- [j21]Fabien Cornillier
, Fayez F. Boctor, Jacques Renaud:
Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur. J. Oper. Res. 220(2): 361-369 (2012) - 2010
- [j20]Marie-Claude Bolduc, Gilbert Laporte, Jacques Renaud, Fayez F. Boctor:
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars. Eur. J. Oper. Res. 202(1): 122-130 (2010) - [j19]Fayez F. Boctor:
Offsetting inventory replenishment cycles to minimize storage space. Eur. J. Oper. Res. 203(2): 321-325 (2010)
2000 – 2009
- 2009
- [j18]Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud:
The petrol station replenishment problem with time windows. Comput. Oper. Res. 36(3): 919-935 (2009) - [j17]Fayez F. Boctor, Jacques Renaud, Angel B. Ruiz, Simon Tremblay:
Optimal and heuristic solution methods for a multiprocessor machine scheduling problem. Comput. Oper. Res. 36(10): 2822-2828 (2009) - 2008
- [j16]Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
A heuristic for the multi-period petrol station replenishment problem. Eur. J. Oper. Res. 191(2): 295-305 (2008) - [j15]Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
An exact algorithm for the petrol station replenishment problem. J. Oper. Res. Soc. 59(5): 607-615 (2008) - [j14]Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J. Oper. Res. Soc. 59(6): 776-787 (2008) - 2007
- [j13]Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor:
A heuristic for the routing and carrier selection problem. Eur. J. Oper. Res. 183(2): 926-932 (2007) - 2006
- [j12]J. Privé, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Solving a vehicle-routing problem arising in soft-drink distribution. J. Oper. Res. Soc. 57(9): 1045-1052 (2006) - 2004
- [j11]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Efficient heuristics for Median Cycle Problems. J. Oper. Res. Soc. 55(2): 179-186 (2004) - 2003
- [j10]Fayez F. Boctor, Gilbert Laporte, Jacques Renaud:
Heuristics for the traveling purchaser problem. Comput. Oper. Res. 30(4): 491-504 (2003) - 2002
- [j9]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
Perturbation heuristics for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 29(9): 1129-1141 (2002) - [j8]Jacques Renaud, Fayez F. Boctor:
A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 140(3): 618-628 (2002) - 2001
- [j7]Jamal Ouenniche, Fayez F. Boctor:
The multi-product, economic lot-sizing problem in flow shops: the powers-of-two heuristic. Comput. Oper. Res. 28(12): 1165-1182 (2001) - [j6]Jamal Ouenniche, Fayez F. Boctor:
The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops. Eur. J. Oper. Res. 129(3): 539-554 (2001) - 2000
- [j5]Fayez F. Boctor, Jacques Renaud:
The column-circular, subsets-selection problem: complexity and solutions. Comput. Oper. Res. 27(4): 383-398 (2000) - [j4]Jacques Renaud, Fayez F. Boctor, Jamal Ouenniche:
A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 27(9): 905-916 (2000)
1990 – 1999
- 1998
- [j3]Jacques Renaud, Fayez F. Boctor:
An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur. J. Oper. Res. 108(3): 571-584 (1998) - 1996
- [j2]Jacques Renaud, Gilbert Laporte, Fayez F. Boctor:
A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Oper. Res. 23(3): 229-235 (1996) - [j1]Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. INFORMS J. Comput. 8(2): 134-143 (1996)
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-04-26 17:39 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:
