NVIDIA's GPU-accelerated cuOpt engine discovers new solutions for four MIPLIB benchmark problems, outperforming CPU solvers with 22% lower objective gaps. NVIDIA's cuOpt optimization engine has found ...
Abstract: This paper investigates a dynamic slab design problem in the steel industry, where order demands arrive dynamically during a given period. Slabs are the raw materials for producing order ...
ABSTRACT: This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to ...
Integer Linear Programming (ILP) is the foundation of combinatorial optimization, which is extensively applied across numerous industries to resolve challenging decision-making issues. Under a set of ...
We introduce a method for solving a quadratic unconstrained binary optimization (QUBO) with the two-way one-hot constraints by dividing the QUBO into parts and solving it with an Ising machine. The ...
This paper considers two-level integer programming problems involving random fuzzy variables with cooperative behavior of the decision makers. Considering the probabilities that the decision makers’ ...
Abstract: This paper presents a tabu search-based heuristic solver for general integer linear programming (ILP) problems as a dependable alternative to branch-and-bound (B&B) solvers. It aims to ...
Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. Its current hardware implementation relies on D-Wave’s ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results