integer linear programming is a popular method of generating school timetables. Although computationally simpler, school timetabling is less developed area than university timetabling, because the models which resolve...
详细信息
integer linear programming is a popular method of generating school timetables. Although computationally simpler, school timetabling is less developed area than university timetabling, because the models which resolve timetabling problems proposed thus far have been adjusted to individual cases differing from country to country. A proposed model meets most of constraints appeared in different school timetabling systems.
This paper studies the problem of static sensor selection for ensuring K-diagnosability in bounded Petri nets. An integer linear programming problem is formulated to determine the minimal number of randomly selected s...
详细信息
This paper studies the problem of static sensor selection for ensuring K-diagnosability in bounded Petri nets. An integer linear programming problem is formulated to determine the minimal number of randomly selected sensors that make K-diagnosable net system with respect to a fault. This value is an estimate of the minimum number of sensors that assures the K-diagnosability of a given fault, which can be further improved taking into account some elements of the net structures.
This paper describes an integer linear programming model conceived as an alternative to a traditional material requirements planning (MRP) system for extending the concept of supply chain synchronisation upstream in a...
详细信息
This paper describes an integer linear programming model conceived as an alternative to a traditional material requirements planning (MRP) system for extending the concept of supply chain synchronisation upstream in a multi-tier supply chain. In this model, we assume there is an incumbent application for transmitting original equipment manufacturer (OEM) requirements to first-, second- and third-tier suppliers. The proposed model is regarded as being embedded within a web-enabled, multi-tier, supply chain information system that provides the application for transmitting the production requirements. The principal motivation for having second-and third-tier suppliers that are synchronised with OEM and first-tier activity is the significant inventory, lead time and responsiveness gains that can potentially be achieved. Here, inventory is considered as a whole across a supply chain, and stock-outs are prohibited for the first-tier supplier. For illustration purposes, an example based on a real, automotive case study is provided. The model results proved better in terms of inventory and bullwhip reduction than those found in a previous simulation-based approach. Also, a comparison of the proposed case results with those of a conventional MRP application is provided.
The advent of the Global Navigation Satellite System (GNSS) has greatly enhanced satellite positioning technology, with Precise Point Positioning (PPP) emerging as a prominent technique. Despite the advantages of PPP,...
详细信息
The basic idea of the geometric approach to learning a Bayesian network (BN) structure is to represent every BN structure by a certain vector. If the vector representative is chosen properly, it allows one to re-formu...
详细信息
The basic idea of the geometric approach to learning a Bayesian network (BN) structure is to represent every BN structure by a certain vector. If the vector representative is chosen properly, it allows one to re-formulate the task of finding the global maximum of a score over BN structures as an integer linear programming (ILP) problem. Such a suitable zero-one vector representative is the characteristic imset, introduced by Student, Hemmecke and Lindner in 2010, in the proceedings of the 5th PGM workshop. In this paper, extensions of characteristic imsets are considered which additionally encode chain graphs without flags equivalent to acyclic directed graphs. The main contribution is a polyhedral description of the respective domain of the ILP problem, that is, by means of a set of linear inequalities. This theoretical result opens the way to the application of ILP software packages. The advantage of our approach is that, as a by-product of the ILP optimization procedure, one may get the essential graph, which is a traditional graphical BN representative. We also describe some computational experiments based on this idea. (C) 2013 Elsevier Inc. All rights reserved.
This paper considers the multi level uncapacitated facility location problem (MLUFLP). A new mixed integer linear programming (MILP) formulation is presented and validity of this formulation is given. Experimental res...
详细信息
This paper considers the multi level uncapacitated facility location problem (MLUFLP). A new mixed integer linear programming (MILP) formulation is presented and validity of this formulation is given. Experimental results are performed on instances known from literature. The results achieved by CPLEX and Gurobi solvers, based on the proposed MILP formulation, are compared to the results obtained by the same solvers on the already known formulations. The results show that CPLEX and Gurobi can optimally solve all small and medium sized instances and even some large-scale instances using the new formulation. (C) 2013 Elsevier Inc. All rights reserved.
We propose an integer linear programming (ILP) approach for solving integer programs with bilinear objectives and linear constraints. Our approach is based on finding upper and lower bounds for the integer ensembles i...
详细信息
We propose an integer linear programming (ILP) approach for solving integer programs with bilinear objectives and linear constraints. Our approach is based on finding upper and lower bounds for the integer ensembles in the bilinear objective function, and using the bounds to obtain a tight ILP reformulation of the original problem, which can then be solved efficiently. Numerical experiments suggest that the proposed approach outperforms a latest iterative ILP approach, with notable reductions in the average solution time. (C) 2014 Elsevier B.V. All rights reserved.
In this paper, an optimum optical power monitor placement is formulated in integer linear programming for crosstalk attack detection by exploiting monitoring information from test connections. The experimental results...
详细信息
In this paper, an optimum optical power monitor placement is formulated in integer linear programming for crosstalk attack detection by exploiting monitoring information from test connections. The experimental results showed that equipping 6 out of 14, 8 out of 15 and 8 out of 16 nodes with optical power monitoring devices in NSF, MESH and GRID topologies are enough to detect the nodes that are traversed by the crosstalk attack in the networks. (C) 2014 Elsevier GmbH. All rights reserved.
The introduction of 5G networks has significantly advanced communication technology, offering faster speeds, lower latency, and greater capacity. This progress sets the stage for Beyond 5G (B5G) networks, which presen...
详细信息
This paper presents a new procedure for solving the integer linear programming problem when the objective function is a linear function and the set of constraints is in the form of linear inequality constraints. The p...
详细信息
This paper presents a new procedure for solving the integer linear programming problem when the objective function is a linear function and the set of constraints is in the form of linear inequality constraints. The proposed procedure is based on the conjugate gradient projection method together with the use of the spirit of Gomory cut. The main idea behind our method is to move through the feasible region through a sequence of points in the direction that improves the objective function. Since methods based on vertex information may have difficulties as the problem size increases, therefore, the present method can be considered as an interior point method, which had been proved to be less sensitive to problem size. A simple production example is given to clarify the theory of this new procedure.
暂无评论