Multi-objective integer non-linear programming (MINP) problems are ubiquitous in real life, however, only the ε-constraint method can be used to solve MINP problems. To improve the computation time of ...

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 ...

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

This repository contains the source code of the implementation of the asynchronous decomposition algorithm for stochastic mixed-integer programs developed/presented in this research article. The ...