Numerical performance of HPR-LP and cuPDLP.jl on 18 LP relaxations (>10M nonzeros in $A$) from MIPLIB 2017 without Gurobi's presolve. Time limit 18000 seconds. Before ...

remove-circle Internet Archive's in-browser bookreader "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see ...

Abstract: In this article, an optimal transportation particle method has been proposed to deal with the data fusion problem. The proposed method can handle prediction, filtering, and smoothing ...

Add a description, image, and links to the linear-programming-problem topic page so that developers can more easily learn about it.

Abstract: This paper investigates the equivalence between a class of mixed-integer linear and linear programming prob-lems. By utilizing the addition of slack variables theorem, we demonstrate that ...

Many important practical computations, such as scheduling, combinatorial, and optimization problems, use techniques known as integer programming to find the best combination of many variables. In ...

Since the open-pit precedence-constrained production scheduling problem is an NP-hard problem, solving it is always a challenging task, especially from a long-term perspective because a mineral ...

We study a class of integer bilevel problems, the so-called Integer Linear Multiplicative Bilevel Problem, ILMBP, where the constraints are linear and both the upper level problem and the lower level ...

Andlinger Center for Energy and the Environment, Princeton University, Princeton, New Jersey 08544, United States Department of Chemical and Biological Engineering, Princeton University, Princeton, ...