Results 31 to 40 of about 72,730 (310)
The integrality number of an integer program [PDF]
We introduce the integrality number of an integer program (IP) in inequality form. Roughly speaking, the integrality number is the smallest number of integer constraints needed to solve an IP via a mixed integer (MIP) relaxation. One notable property of this number is its invariance under unimodular transformations of the constraint matrix. Considering
Joseph Paat +2 more
openaire +3 more sources
An Insight into the Characteristic Equation for an Integer Program [PDF]
This article enhances properties and applications associated with the characteristic equation (CE) developed to find an optimal and other ranked-optimal solutions of linear integer programming model.
Santosh Kumar +2 more
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
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
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
Stochastic Integer Programming by Dynamic Programming [PDF]
AbstractStochastic integer programming is a suitable tool for modeling hierarchical decision situations with combinatorial features. In continuation of our work on the design and analysis of heuristics for such problems, we now try to find optimal solutions.
B.J. Lageweg +4 more
openaire +6 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
Accelerated non-negative tensor completion via integer programming
The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have polynomial-time computation but require exponentially more ...
Wenhao Pan +3 more
doaj +1 more source
Experiments in integer programming
AbstractA hybrid algorithm to solve large scale zero–one integer programming problems has been developed. The algorithm combines branch-and-bound, enumeration and cutting plane techniques. Mixed-integer cuts are generated in the initial phase of the algorithm and added to the L.P.
Ellis L. Johnson, Uwe H. Suhl
openaire +2 more sources
Integer programming model for distance-edge-monitoring problem [PDF]
The paper considers the recently introduced distance-edge-monitoring problem. For a given graph G = (V,E), the set M is called distance-edge-monitoring if it is a subset of V and for every edge e of E there is a vertex x of M and a vertex y of V such ...
Kartelj Aleksandar +2 more
doaj +1 more source

