Tanka Nath Dhamala

Orcid: 0000-0003-3390-9707

According to our database1, Tanka Nath Dhamala authored at least 16 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Generalized maximum flow over time with intermediate storage.
Ann. Oper. Res., April, 2024

2023
In Memoriam: Urmila Pyakurel (1980-2023).
Oper. Res. Forum, December, 2023

Multi-commodity flow problem on lossy network with partial lane reversals.
Ann. Oper. Res., April, 2023

Abstract network flow with intermediate storage for evacuation planning.
Eur. J. Oper. Res., 2023

2022
Efficient Algorithms for Abstract Flow with Partial Switching.
Oper. Res. Forum, November, 2022

Dynamic Multicommodity Contraflow Problem with Asymmetric Transit Times.
J. Appl. Math., 2022

A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow.
Asia Pac. J. Oper. Res., 2022

2021
Network Reconfiguration with Orientation-Dependent Transit Times.
Int. J. Math. Math. Sci., 2021

2020
Efficient Algorithms on Multicommodity Flow over Time Problems with Partial Lane Reversals.
Int. J. Math. Math. Sci., 2020

Flow Improvement in Evacuation Planning with Budget Constrained Switching Costs.
Int. J. Math. Math. Sci., 2020

2019
Partial contraflow with path reversals for evacuation planning.
Ann. Oper. Res., 2019

2017
Efficient continuous contraflow algorithms for evacuation planning problems.
Ann. Oper. Res., 2017

Continuous Dynamic Contraflow Approach for Evacuation Planning.
Ann. Oper. Res., 2017

2016
Continuous Time Dynamic Contraflow Models and Algorithms.
Adv. Oper. Res., 2016

2012
An efficient frontier for sum deviation JIT sequencing problem in mixed-model systems via apportionment.
Int. J. Autom. Comput., 2012

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan.
Ann. Oper. Res., 2012


  Loading...