default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDT. T. Narendran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j15]Subramanian Pazhani
, Abraham Mendoza, Ramkumar Nambirajan, T. T. Narendran, K. Ganesh, Elías Olivares Benítez:
Multi-period multi-product closed loop supply chain network design: A relaxation approach. Comput. Ind. Eng. 155: 107191 (2021)- 2020
- [j14]Ramkumar Nambirajan, Abraham Mendoza, Subramanian Pazhani, T. T. Narendran, K. Ganesh:
CAR: heuristics for the inventory routing problem. Wirel. Networks 26(8): 5783-5808 (2020) - 2018
- [j13]Binay Dash, M. S. Gajanand, T. T. Narendran:
A model for planning the product portfolio and launch timings under resource constraints. Int. J. Prod. Res. 56(15): 5081-5103 (2018) - 2016
- [j12]Ramkumar Nambirajan, Abraham Mendoza, Subramanian Pazhani, T. T. Narendran, K. Ganesh:
CARE: Heuristics for two-stage multi-product inventory routing problems with replenishments. Comput. Ind. Eng. 97: 41-57 (2016) - 2013
- [j11]P. Subramanian, N. Ramkumar, T. T. Narendran, K. Ganesh:
PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem. Appl. Soft Comput. 13(2): 1121-1135 (2013) - [j10]N. Ramkumar, P. Subramanian, T. T. Narendran, K. Ganesh:
An Approach for Setting Inventory Norms for a Two-Echelon Supply Chain. Int. J. Inf. Syst. Supply Chain Manag. 6(4): 102-119 (2013) - 2012
- [j9]A. Chandramouli, L. Vivek Srinivasan, T. T. Narendran:
Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization. Int. J. Green Comput. 3(2): 34-50 (2012) - 2011
- [j8]P. N. Ram Kumar, T. T. Narendran:
On the usage of Lagrangean Relaxation for the convoy movement problem. J. Oper. Res. Soc. 62(4): 722-728 (2011) - 2010
- [j7]P. Subramanian, N. Ramkumar, T. T. Narendran:
Mathematical model for multi-echelon, multi-product, single time-period closed loop supply chain. Int. J. Bus. Perform. Supply Chain Model. 2(3/4): 216-236 (2010) - 2008
- [j6]P. N. Ram Kumar, T. T. Narendran:
Integer programming formulation for convoy movement problem. Int. J. Intell. Def. Support Syst. 1(3): 177-188 (2008) - 2007
- [j5]T. Godwin, Ram Gopalan, T. T. Narendran:
Freight Train Routing and Scheduling in a passenger rail Network: Computational Complexity and the Stepwise Dispatching Heuristic. Asia Pac. J. Oper. Res. 24(4): 499-533 (2007) - [j4]K. Ganesh, T. T. Narendran:
CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up. Eur. J. Oper. Res. 178(3): 699-717 (2007) - 2006
- [j3]T. Godwin, Ram Gopalan, T. T. Narendran:
Locomotive assignment and freight train scheduling using genetic algorithms. Int. Trans. Oper. Res. 13(4): 299-332 (2006) - 1997
- [j2]G. Jayakrishnan Nair, T. T. Narendran:
On the use of the asymptotic forms of the boolean matrix for designing cellular manufacturing systems - An improved approach. Eur. J. Oper. Res. 100(3): 429-440 (1997) - 1990
- [j1]V. Venugopal, T. T. Narendran:
An interactive procedure for multiobjective optimization using nash bargaining principle. Decis. Support Syst. 6(3): 261-268 (1990)
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 2025-01-21 00:02 CET 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:
