Results 21 to 30 of about 3,944,498 (171)
Methods for optimizing routes in digital logistics [PDF]
E3S Web of Conferences, 2021 The current problem of digital logistics is investigated - the calculation of optimal routes for freight transportation by computer means to reduce time and distance. Heuristic methods used in logistics for constructing optimal routes are considered.
Ivanova Lubov +2 more
doaj +1 more source
Parametrizing an Integer Linear Program by an Integer [PDF]
SIAM Journal on Discrete Mathematics, 2018 We consider a family of integer linear programs in which the coefficients of the constraints and objective function are polynomials of an integer parameter $t.$ For $\ell$ in $\mathbb{Z}_+,$ we define $f_\ell(t)$ to be the $\ell$th largest value of the objective function with multiplicity for the integer linear program at $t.$ We prove that for all ...
openaire +4 more sources
An Optimal Generation Scheduling Approach Based on Linear Relaxation and Mixed Integer Programming
IEEE Access, 2020 This paper proposes an optimal generation scheduling approach based on linear relaxation and mixed integer programming, which is used to solve the generation dispatch problem.
Yunkai Lei +5 more
doaj +1 more source
MemComputing Integer Linear Programming
CoRR, 2018 Integer linear programming (ILP) encompasses a very important class of optimization problems that are of great interest to both academia and industry. Several algorithms are available that attempt to explore the solution space of this class efficiently, while requiring a reasonable compute time.
Traversa, Fabio L +1 more
openaire +4 more sources
Analyzing Infeasible Mixed-Integer and Integer Linear Programs [PDF]
INFORMS Journal on Computing, 1999 Algorithms and computer-based tools for analyzing infeasible linear and nonlinear programs have been developed in recent years, but few such tools exist for infeasible mixed-integer or integer linear programs. One approach that has proven especially useful for infeasible linear programs is the isolation of an Irreducible Infeasible Set of constraints (
Olivier Guieu, John W. Chinneck
openaire +3 more sources
Solving a Fully Rough Integer Linear Fractional Programming Problem [PDF]
Delta Journal of Science, 2019 In this paper, a fully rough integer linear fractional programmingproblem is introduced, in which all coefficients and decision variablesin the objective function and the constraints are rough intervals.
Tarek El jerbi, El-Saeed Ammar
doaj +1 more source
On Solving Fully Rough Multi-Objective Integer Linear Programming Problems [PDF]
Delta Journal of Science, 2019 In this paper a suggested algorithm to solve fully rough multi-objectiveinteger linear programming problem [FRMOILP] is described. In orderto solve this problem and find rough value efficient solutions anddecision rough integer variables by the slice-sum
Abdusalam Emsimir, El-Saeed Ammar
doaj +1 more source
A linear algorithm for integer programming in the plane [PDF]
Mathematical Programming, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eisenbrand, Friedrich, Laue, Sören
openaire +4 more sources
Linear, integer separable and fuzzy programming problems: a united approach towards automatic reformulation [PDF]
, 1986 For mathematical programming (MP) to have greater impact as a decision tool, MP software systems must offer suitable support in terms of model communication and modelling techniques.
Mitra, G +3 more
core +4 more sources
An Integer Linear Programming Model for Partially Ordered Sets
Journal of Mathematics, 2022 Linear programming is an important approach that is used to represent a large class of combinatorial optimization problems. The simplex algorithm is one of the algorithms for solving linear programming problems with exponential time complexity ...
Elsayed Badr +3 more
doaj +1 more source