default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTanka Nath Dhamala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Tanka Nath Dhamala
, Mohan Chandra Adhikari, Durga Prasad Khanal, Urmila Pyakurel:
Generalized maximum flow over time with intermediate storage. Ann. Oper. Res. 335(1): 111-134 (2024)- 2023
- [j15]Shiva Prakash Gupta, Urmila Pyakurel, Tanka Nath Dhamala:
Multi-commodity flow problem on lossy network with partial lane reversals. Ann. Oper. Res. 323(1): 45-63 (2023) - [j14]Urmila Pyakurel, Durga Prasad Khanal, Tanka Nath Dhamala:
Abstract network flow with intermediate storage for evacuation planning. Eur. J. Oper. Res. 305(3): 1178-1193 (2023) - [j13]Tanka Nath Dhamala, Anna Nagurney:
In Memoriam: Urmila Pyakurel (1980-2023). Oper. Res. Forum 4(4): 93 (2023) - 2022
- [j12]Hari Nandan Nath, Stephan Dempe, Tanka Nath Dhamala:
A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow. Asia Pac. J. Oper. Res. 39(3): 2150027:1-2150027:24 (2022) - [j11]Shiva Prakash Gupta, Urmila Pyakurel, Tanka Nath Dhamala:
Dynamic Multicommodity Contraflow Problem with Asymmetric Transit Times. J. Appl. Math. 2022: 3697141:1-3697141:8 (2022) - [j10]Durga Prasad Khanal, Urmila Pyakurel, Tanka Nath Dhamala, Stephan Dempe:
Efficient Algorithms for Abstract Flow with Partial Switching. Oper. Res. Forum 3(4) (2022) - 2021
- [j9]Hari Nandan Nath, Urmila Pyakurel, Tanka Nath Dhamala:
Network Reconfiguration with Orientation-Dependent Transit Times. Int. J. Math. Math. Sci. 2021: 6613622:1-6613622:11 (2021) - 2020
- [j8]Ram Chandra Dhungana, Tanka Nath Dhamala:
Flow Improvement in Evacuation Planning with Budget Constrained Switching Costs. Int. J. Math. Math. Sci. 2020: 1605806:1-1605806:10 (2020) - [j7]Urmila Pyakurel, Shiva Prakash Gupta, Durga Prasad Khanal, Tanka Nath Dhamala:
Efficient Algorithms on Multicommodity Flow over Time Problems with Partial Lane Reversals. Int. J. Math. Math. Sci. 2020: 2676378:1-2676378:13 (2020)
2010 – 2019
- 2019
- [j6]Urmila Pyakurel, Hari Nandan Nath, Tanka Nath Dhamala:
Partial contraflow with path reversals for evacuation planning. Ann. Oper. Res. 283(1-2): 591-612 (2019) - 2017
- [j5]Urmila Pyakurel, Tanka Nath Dhamala:
Continuous Dynamic Contraflow Approach for Evacuation Planning. Ann. Oper. Res. 253(1): 573-598 (2017) - [j4]Urmila Pyakurel, Tanka Nath Dhamala, Stephan Dempe:
Efficient continuous contraflow algorithms for evacuation planning problems. Ann. Oper. Res. 254(1-2): 335-364 (2017) - 2016
- [j3]Urmila Pyakurel, Tanka Nath Dhamala:
Continuous Time Dynamic Contraflow Models and Algorithms. Adv. Oper. Res. 2016: 7902460:1-7902460:7 (2016) - 2012
- [j2]Michael Andresen, Tanka Nath Dhamala:
New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan. Ann. Oper. Res. 196(1): 1-26 (2012) - [j1]Tanka Nath Dhamala, Gyan Bahadur Thapa, Hongnian Yu:
An efficient frontier for sum deviation JIT sequencing problem in mixed-model systems via apportionment. Int. J. Autom. Comput. 9(1): 87-97 (2012)
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-24 23:00 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:
