85 Result(s)
-
Article
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
In this paper, we design a 2-approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties based on Lovász rounding technique, which improves ...
-
Article
Minimum total coloring of planar graphs with maximum degree 8
We define G to be a planar graph with maximum degree \(\varDelta \) Δ . Supp...
-
Article
Distance magic labeling of the halved folded n-cube
Hypercube is an important structure for computer networks. The distance plays an important role in its applications. In this paper, we study a magic labeling of the halved folded n-cube which is a variation of th...
-
Chapter and Conference Paper
Research on Strategic Management Method Based on Supply Chain Flexibility Model
Supply chain management, as a basic concept at the strategic level, is more focused on maximizing the overall value of the end customer to enhance the competitive advantage and strategy of enterprise developme...
-
Article
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
Submodular optimization problem has been concerned in recent years. The problem of maximizing submodular and non-submodular functions on the integer lattice has received a lot of recent attention. In this pape...
-
Article
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
In this paper, we consider the parallel-machine scheduling problem with release dates and submodular rejection penalties. In this problem, we are given m identical parallel machines and n jobs. Each job has a pro...
-
Article
Adaptive seeding for profit maximization in social networks
Social networks are becoming important dissemination platforms, and a large body of works have been performed on viral marketing, but most are to maximize the benefits associated with the number of active node...
-
Article
An approximation algorithm for the submodular multicut problem in trees with linear penalties
In this paper, we consider the submodular multicut problem in trees with linear penalties (SMCLP(T) problem). In the SMCLP(T) problem, we are given a tree ...
-
Article
An approximation algorithm for the k-generalized Steiner forest problem
In this paper, we introduce the k-generalized Steiner forest (k-GSF) problem, which is a natural generalization of the k-Steiner forest problem and the generalized Steiner forest problem. In this problem, we are ...
-
Article
Discount allocation for cost minimization in online social networks
We introduce the discount allocation problem to a new online social networks (OSNs) scenario where the nodes and the relationships between nodes are determined but the states of edges between nodes are unknown...
-
Article
Order Timing for Manufacturers with Spot Purchasing Price Uncertainty and Demand Information Updating
In this paper we study the competitive order timing decisions of two manufacturers with demand forecasting updating and uncertain raw material price. Manufacturers can order the raw materials early when the ma...
-
Article
Laboratory experiments can pre-design to address power and selection issues
In this paper, motivated by aspects of preregistration plans we discuss issues that we believe have important implications for how experiments are designed. To make possible valid inferences about the effects ...
-
Article
Mismatch risk allocation in a coproduct supply chain
Products such as cattles and pigs can be processed into several types of products (parts) targeting different segments of customers, which belong to the so called coproducts. Mismatch risk is a significant issue ...
-
Article
Objective scaling ensemble approach for integer linear programming
The objective scaling ensemble approach is a novel two-phase heuristic for integer linear programming problems shown to be effective on a wide variety of integer linear programming problems. The technique iden...
-
Article
On the metric dimension of the folded n-cube
A subset S of vertices in a graph G is called a resolving set for G if for arbitrary two distinct vertices \(u, v\in V\)u,v∈V, there exists a vertex x from S such that the distances \(d(u, x)\ne d(v, x)\)d(u,x)≠d
-
Article
Maximizing profit of multiple adoptions in social networks with a martingale approach
Information propagation plays an important role in social network, which helps sha** consumer’s purchasing decisions. Most of existing works focus on maximizing the influence of one product. But in our reali...
-
Article
Speech corpora subset selection based on time-continuous utterances features
An extremely large corpus with rich acoustic properties is very useful for training new speech recognition and semantic analysis models. However, it also brings some troubles, because the complexity of the aco...
-
Article
On general threshold and general cascade models of social influence
The information diffusion model is a very important factor in study of the influence maximization problem. This paper contains two notes. The first one is a simplified proof of Kempe–Kleinberg–Tadös conjecture...
-
Article
Analysis of market competition and information asymmetry on selling strategies
In this paper, we consider the seller’s selling strategies in a supply chain consisting of one supplier and multiple retailers, who compete in the same consumer market. The production lead time is relatively l...
-
Article
Total coloring of planar graphs without adjacent chordal 6-cycles
A total coloring of a graph G is a coloring such that no two adjacent or incident elements receive the same color. In this field there is a famous conjecture, named Total Coloring Conjecture, saying that the the ...
