A Novel Alternative Algorithm for Solving Integer Linear Programming Problems Having Three Variables
In this study, a novel alternative method based on parameterization for solving Integer Linear Programming (ILP) problems having three variables is developed.
Alan Kadriye Simsek
doaj +1 more source
Developments in linear and integer programming [PDF]
In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems ...
Darby-Dowman, K, Wilson, J M
core +1 more source
A New Algorithms in Mixed Integer Programming Problems [PDF]
In this paper we have studied two new algorithms for solving mixed IPP. In the 1st algorithm we have investigated a new short technique for searching to the efficient cut in the standard cutting plane procedure to obtain the same optimal solution by ...
Basim Hassan, Abbas Al-Bayati
doaj +1 more source
Discrete Optimization: The Case of Generalized BCC Lattice
Recently, operations research, especially linear integer-programming, is used in various grids to find optimal paths and, based on that, digital distance.
Gergely Kovács +4 more
doaj +1 more source
An exact method for a discrete multiobjective linear fractional optimization [PDF]
Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming.
Chergui, M. E-A, Moulai, M.
core +2 more sources
A Hybrid IP/GA Approach to the Parallel Production Lines Scheduling Problem
A special parallel production lines scheduling problem is studied in this paper. Considering the time window and technical constraints, a mixed integer linear programming (MILP) model is formulated for the problem.
Huizhi Ren, Shenshen Sun
doaj +1 more source
New Hybrid Cutting Plane Method For Solving Integer Linear Programming Problems [PDF]
This work deals with a new method for solving Integer Linear Programming Problems depending on a previous methods for solving these problems such that Branch and Bound method and Cutting Planes method where this new method is a combination between them ...
Abbas Al-Bayati, Nawar Abdullah
doaj +1 more source
Exact solution approaches for the workload smoothing in assembly lines
In this paper, the problem of minimizing the smoothness index for an assembly line given a fixed cycle time and the number of workstations is studied. This problem which is known as the workload smoothing line balancing problem (WSLBP) is a mixed-integer
Derya Dinler, Mustafa Kemal Tural
doaj +1 more source
Optimising a nonlinear utility function in multi-objective integer programming [PDF]
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility ...
A. Przybylski +22 more
core +2 more sources
Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model
In this paper we describe the automatic instantiation of a Variable Neighborhood Descent procedure from a Mixed Integer Programming model. We extend a recent approach in which a single neighborhood structure is automatically designed from a Mixed Integer
Tommaso Adamo +3 more
doaj +1 more source

