Brian J. Lunday
Orcid: 0000-0001-5191-4361
According to our database1,
Brian J. Lunday
authored at least 39 papers
between 2010 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
A multiple asset-type, collaborative vehicle routing problem with proximal servicing of demands.
Eur. J. Oper. Res., 2025
2024
Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis.
Comput. Oper. Res., February, 2024
Eur. J. Oper. Res., 2024
Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem.
Comput. Oper. Res., 2024
2023
Social network analysis of Twitter interactions: a directed multilayer network approach.
Soc. Netw. Anal. Min., December, 2023
Solving nonstationary Markov decision processes via contextual decomposition: A military air battle management application.
Expert Syst. Appl., December, 2023
Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming.
Eur. J. Oper. Res., 2023
2022
Transportation Labor Cost Reduction via Vehicle Platooning: Alternative Models and Solution Methods.
Transp. Sci., 2022
Optimal heterogeneous search and rescue asset location modeling for expected spatiotemporal demands using historic event data.
J. Oper. Res. Soc., 2022
2021
Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies.
INFORMS J. Comput., 2021
Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem.
Eur. J. Oper. Res., 2021
Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty.
Eur. J. Oper. Res., 2021
2020
A heuristic and metaheuristic approach to the static weapon target assignment problem.
J. Glob. Optim., 2020
Robust influence modeling under structural and parametric uncertainty: An Afghan counternarcotics use case.
Decis. Support Syst., 2020
An approximate dynamic programming approach for comparing firing policies in a networked air defense environment.
Comput. Oper. Res., 2020
Ann. Oper. Res., 2020
2019
IISE Trans., 2019
J. Heuristics, 2019
Influence modeling: Mathematical programming representations of persuasion under either risk or uncertainty.
Eur. J. Oper. Res., 2019
Solving The Army's Cyber Workforce Planning Problem Using Stochastic Optimization and Discrete-Event Simulation Modeling.
Proceedings of the 2019 Winter Simulation Conference, 2019
2018
Comput. Oper. Res., 2018
Examining military medical evacuation dispatching policies utilizing a Markov decision process model of a controlled queueing system.
Ann. Oper. Res., 2018
2017
Heterogeneous surface-to-air missile defense battery location: a game theoretic approach.
J. Heuristics, 2017
Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets.
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
2016
A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries.
INFORMS J. Comput., 2016
Eur. J. Oper. Res., 2016
Approximate dynamic programming for the dispatch of military medical evacuation assets.
Eur. J. Oper. Res., 2016
2015
2013
2012
Minimizing the maximum network flow: models and algorithms with resource synergy considerations.
J. Oper. Res. Soc., 2012
Comput. Manag. Sci., 2012
Network interdiction to minimize the maximum probability of evasion with synergy between applied resources.
Ann. Oper. Res., 2012
2010
Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods.
PhD thesis, 2010
INFORMS J. Comput., 2010