Results 301 to 310 of about 603,661 (358)
Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers. [PDF]
Quinton FA+4 more
europepmc +1 more source
Integer programming as a powerful tool for polyclonal selection in ancient grapevine varieties. [PDF]
Surgy S, Cadima J, Gonçalves E.
europepmc +1 more source
A multi-objective multi-period mathematical programming model for integrated project portfolio optimization and contractor selection. [PDF]
Zahedirad M+3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Trajectory Optimization for High-Speed Trains via a Mixed Integer Linear Programming Approach
IEEE transactions on intelligent transportation systems (Print), 2022This paper proposes a trajectory optimization approach for high-speed trains to reduce traction energy consumption and increase riding comfort. Besides, the proposed approach can also achieve energy-saving effects by optimizing the operation time between
Yuan Cao+3 more
semanticscholar +1 more source
Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
INFORMS journal on computing, 2020Piecewise linear (PWL) functions are used in a variety of applications. Computing such continuous PWL functions, however, is a challenging task. Software packages and the literature on PWL function fitting are dominated by heuristic methods. This is true
Steffen Rebennack, V. Krasko
semanticscholar +1 more source
Simple and fast algorithm for binary integer and online linear programming
Mathematical programming, 2020In this paper, we develop a simple and fast online algorithm for solving a class of binary integer linear programs (LPs) arisen in general resource allocation problem.
Xiaocheng Li, Chunlin Sun, Y. Ye
semanticscholar +1 more source
An integer linear programming approach for bilinear integer programming [PDF]
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling
Alexandre S. Freire+2 more
openaire +1 more source