We propose a framework to compute approximate Nash equilibria in integer programming games with nonlinear payoffs, i.e., simultaneous and non-cooperative games where each player solves a parametrized mixed-integer non...
详细信息
In project management, the resource allocation problem consists of determining a schedule for the set of project activities that are related to each other by prescribed precedence relations and that require some time ...
详细信息
ISBN:
(数字)9798350386097
ISBN:
(纸本)9798350386103
In project management, the resource allocation problem consists of determining a schedule for the set of project activities that are related to each other by prescribed precedence relations and that require some time and some scarce resources to complete. In general, the goal is to minimize the project duration or time-to-market. In many cases, each resource represents a team of people with specific skills, such as engineering or marketing specialists. To promote team productivity and cohesion, it is often desirable to balance the workload within the team, i.e. among the resource units. We analyze two alternative approaches to formulate appropriate workload-balancing constraints in a mixed-binary linear optimization problem. In the first approach, the maximum deviation of each unit’s workload from the average workload is bounded, and in the second approach, the maximum workload difference between any pair of units is bounded. Our computational results for a standard test set from the literature show that balanced workloads can generally be achieved without increasing project duration; moreover, the second approach provides more flexibility, resulting in fewer instances for which no feasible solution exists.
Community detection, which requires the clustering of the vertices of a network graph, is an important component of network science. A variety of mathematical programming models and heuristics have been developed for ...
详细信息
This paper focuses on the application of quantitative portfolio management by using integer programming and clustering techniques. Investors seek to gain the highest profits and lowest risk in capital markets. A data-...
详细信息
PMUs or synchronized PMUs are rapidly becoming essential in today’s power systems acting as monitors in the advancement of mainstream grid supervisory, protective, and controlling systems. This paper presents an impr...
详细信息
ISBN:
(数字)9798350350067
ISBN:
(纸本)9798350350074
PMUs or synchronized PMUs are rapidly becoming essential in today’s power systems acting as monitors in the advancement of mainstream grid supervisory, protective, and controlling systems. This paper presents an improvement of the existing methodology for PMU placement by incorporating Machine Learning algorithm coupled with binary integer programming in order to feed real-time grid conditions and demand forecasts into the algorithm. Addressing four primary constraints: 1) observability in fully and partially observable cases; 2) conventional measurements across various cases; 3) network robustness against single PMU or a communication line; and finally, 4) flexibility with regards to increasing or decreasing failure rates, this augmented approach includes, but does not limit to, machine learning-based predicative analysis for a dynamic power grid management. Employed on IEEE 14-bus, a 21-bus $400-\mathrm{kV}$ real power system, as well as the IEEE 30-bus system, strategy helps in creating a cost-effective, secure and smart monitoring system.
Latency-aware pruning, which explores the filter structure across each layer by reflecting latency characteristics specific to the hardware, is an effective network compression method for accelerating neural network m...
详细信息
ISBN:
(数字)9788993215380
ISBN:
(纸本)9798331517939
Latency-aware pruning, which explores the filter structure across each layer by reflecting latency characteristics specific to the hardware, is an effective network compression method for accelerating neural network models in hardware environment. However, due to the high cost of exploring numerous filter structures, previous studies had the drawback of being time-consuming in searching for the optimal filter structure. To address this issue, we propose a latency-aware pruning method that can find the optimal filter structure through integer Linear programming(ILP). In this approach, we design an objective function for finding the optimal filter structure by the linear combination of filter importance per layer, and use ILP to quickly find the filter structure that satisfies the target latency. Experimental results show that our method not only improves the performance of pruned networks in terms of accuracy and latency, but also explores filter structures more quickly compared to previous method.
The branch-and-cut algorithm is the method of choice to solve large scale integer programming problems in practice. A key ingredient of branch-and-cut is the use of cutting planes which are derived constraints that re...
详细信息
Singular value decomposition (SVD) is a commonly employed matrix factorization. In real-world applications, the data requiring SVD is usually batched in small matrices within a size not greater than 1024 times 1024. H...
详细信息
ISBN:
(数字)9798350373523
ISBN:
(纸本)9798350373530
Singular value decomposition (SVD) is a commonly employed matrix factorization. In real-world applications, the data requiring SVD is usually batched in small matrices within a size not greater than 1024 times 1024. However, the professional high performance libraries on CPU like MKL do not provide any interfaces for batched SVD while the libraries on GPU such as Nvidia cuSOLVER do not provide ones within matrices greater than 32 times 32. Although several studies aim to address this problem, they only focus on GPU’s computing power but ignore CPUs’. In this paper, we improve the batched SVD from the novel perspective of heterogeneous computing within matrices greater than 32 times 32 but not greater than 1024 times 1024. We propose a methodology based on statistics and integer programming to partition data between CPU and GPU. The evaluation demonstrates that compared to cuSOLVER, our proposed methodology can achieve a speedup of 1.4x - 1.9x.
integer programming with block structures has received considerable attention recently and is widely used in many practical applications such as train timetabling and vehicle routing problems. It is known to be NP-har...
详细信息
There is no question to the fact that electric vehicles (EVs) are the most viable solution to the climate change that the planet has long been combating. Along the same line, it is a salient subject to expand the avai...
详细信息
ISBN:
(数字)9798350317664
ISBN:
(纸本)9798350317671
There is no question to the fact that electric vehicles (EVs) are the most viable solution to the climate change that the planet has long been combating. Along the same line, it is a salient subject to expand the availability of charging infrastructure, which quintessentially necessitates the optimization of the charger’s locations. This paper proposes to formulate the optimal EV charger location problem into a facility location problem (FLP). As an effort to find an efficient method to solve the well-known nonpolynomial deterministic (NP)-hard problem, we present a comparative quantification among several representative solving techniques.
暂无评论