|
|
|
|
|
Davide Bilò, Luciano Gualà and Guido Proietti
Consider a communication network represented by a directed graph ??=(??,??)
G
=
(
V
,
E
)
of n nodes and m edges. Assume that edges in E are partitioned into two sets: a set C of edges with a fixed non-negative real cost, and a set P of edges whose cost...
ver más
|
|
|
|
|
|
|
|
|
Yu-Hung Chien, Chung-Piao Chiang
Pág. 18 - 21
This study focuses on the problem of determining the optimal coverage period and selling price of warranted products from the manufacturer?s perspective. We first consider how to maximize the profit per unit under the assumption that the product can be s...
ver más
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 6 - 10
The paper presents a new method for solving the 0?1 linear programming problems (LPs). The general 0?1 LPs are believed to be NP-hard and a consistent, efficient general-purpose algorithm for these models has not been found so far. Cutting planes an...
ver más
|
|
|
|
|
|
|
|
|
Jing Zhang, Xiangpeng Zhan, Taoyong Li, Linru Jiang, Jun Yang, Yuanxing Zhang, Xiaohong Diao and Sining Han
The problem of electricity pricing for charging stations is a multi-objective mixed integer nonlinear programming. Existing algorithms have low efficiency in solving this problem. In this paper, a convex optimization algorithm is proposed to get the opti...
ver más
|
|
|
|
|
|
|
|
|
Jian Yang and Chunxiao Xing
In the era of the digital economy, data has become a new key production factor, and personal data represents the monetary value of a data-driven economy. Both the public and private sectors want to use these data for research and business. However, due t...
ver más
|
|
|
|