By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...

To accurately simulate the thin layer of linear dispersive media, an improved 3-D finite-difference time-domain (FDTD) method is proposed. The inclusion of a weak conditionally stabilized hybrid ...

julia genetic-algorithm np-hard gurobi constraint-programming heuristics minizinc branch-and-bound flow-shop integer-linear-programming lagrangian-heuristic constrained-minimum-spanning-tree ...