Vicky H. Mak-Hau
Orcid: 0000-0002-9306-5780Affiliations:
- Deakin University, Burwood, Australia
According to our database1,
Vicky H. Mak-Hau
authored at least 36 papers
between 2006 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
FlexBeamOpt: Hybrid solution methodologies for high-throughput GEO satellite beam laydown and resource allocation.
Int. J. Satell. Commun. Netw., 2023
Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, 2023
2022
Aggregation of Interacting Criteria in Land Combat Vehicle Selection by Using Fuzzy Measures.
IEEE Trans. Fuzzy Syst., 2022
An efficient and exact algorithm for military timetabling and trainee assignment problems.
Comput. Ind. Eng., 2022
Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty.
Ann. Oper. Res., 2022
2021
EWNStream+: Effective and Real-time Clustering of Short Text Streams Using Evolutionary Word Relation Network.
Int. J. Inf. Technol. Decis. Mak., 2021
CoRR, 2021
A simultaneous sequencing and allocation problem for military pilot training: Integer programming approaches.
Comput. Ind. Eng., 2021
2020
Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange.
Comput. Oper. Res., 2020
Proceedings of the 20th IEEE International Conference on Data Mining, 2020
2018
Knowl. Based Syst., 2018
J. Netw. Syst. Manag., 2018
A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs.
Comput. Oper. Res., 2018
Capacity Analysis for aircrew Training Schools - estimating Optimal manpower flows under Time varying Policy and Resource Constraints.
Proceedings of the 2018 Winter Simulation Conference, 2018
2017
On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches.
J. Comb. Optim., 2017
Comput. Secur., 2017
2015
A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, Tomotherapy, and Cyberknife.
Comput. Oper. Res., 2015
Catabolism attack and Anabolism defense: A novel attack and traceback mechanism in Opportunistic Networks.
Comput. Commun., 2015
A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning.
Comput. Optim. Appl., 2015
An Efficient Detection Mechanism Against Packet Faking Attack in Opportunistic Networks.
Proceedings of the Future Network Systems and Security - First International Conference, 2015
2014
Proceedings of the Tenth International Conference on Computational Intelligence and Security, 2014
2013
J. Comb. Optim., 2013
2012
An exact method for minimizing the total treatment time in intensity-modulated radiotherapy.
J. Oper. Res. Soc., 2012
2010
Comput. Networks, 2010
2009
Pervasive Mob. Comput., 2009
An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy.
INFORMS J. Comput., 2009
2008
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008
2007
Oper. Res. Lett., 2007
New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP.
Math. Methods Oper. Res., 2007
Polyhedral studies for minimum-span graph labelling with integer distance constraints.
Int. Trans. Oper. Res., 2007
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs.
Discret. Appl. Math., 2007
2006
Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem.
J. Comb. Optim., 2006
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs.
Discret. Optim., 2006