//-->
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
Gmys, Jan, (2020)
CUDA accelerated HAPO (C-HAPO) algorithm for fast responses in vehicular ad hoc networks
Jindal, Vinita, (2020)
Implementing the rearrangement algorithm : an example from computational risk management
Hofert, Marius, (2020)
The maximum feasible subset problem (maxFS) and applications
Chinneck, John W., (2019)
MINOS(IIS) version 4.2: Analyzing infeasibilities in linear programs
Chinneck, John W., (1995)
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
Chaudhry, Aizaz U., (2016)