Tanka Nath Dhamala

Orcid: 0000-0003-3390-9707

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

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

2026
Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage.
Eur. J. Oper. Res., 2026

2025
Network restructuring for dynamic flow improvement.
Ann. Oper. Res., April, 2025

Maximum Dynamic FlowLoc with Intermediate Storage: A Temporally Repeated Approach.
Oper. Res. Forum, 2025

Non-Conservative Maximum Flow by Centiles-Method in Uncertain Network.
J. Uncertain Syst., 2025

Abstract Maximum Flow with Partial Switching.
J. Uncertain Syst., 2025

2024
Order-Guided Non-Conservative Maximum Flow in Uncertain Network Interdiction Problem with Budget Constraint.
J. Uncertain Syst., December, 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...