期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021; 42 (1)
Target traversing is an important research topic in wireless sensor networks, with most studies examining coverage issues of the target's moving paths......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021; 41 (4)
Let G=(V,E) be a graph. A complete subgraph of G is a subgraph of pairwise adjacent vertices of V of size at least 2. Let phi(C)(G) be the set of all ......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021; 42 (1)
The total proper connection number of a given digraph D, represented by (tpc) over right arrow( D), denotes the smallest number of colors needed for m......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021; 42 (1)
Feature selection in logical analysis of data (LAD) can be cast into a set covering problem. In this paper, extending the results on feature selection......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021; 42 (1)
In this paper, we study Roman {k}-dominating functions on a graph G with vertex set V for a positive integer k: a variant of {k}-dominating functions,......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021; 42 (1)
The concept of rainbow disconnection number of graphs was introduced by Chartrand et al. (2018). Inspired by this concept, we put forward the concepts......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
We consider the problem of scheduling a set of jobs with different processing times and sizes on a single bounded parallel-batch machine with periodic......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
In recent years, with themore and more researchers studying the problem of maximizing monotone (nonsubmodular) objective functions, the approximation ......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
Emerging applications in machine learning have imposed the problem of monotone non-submodular maximization subject to a cardinality constraint. Meanwh......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
This paper introduces a new environment of online scheduling in which jobs are scheduled under the non-delayed processing (NDP) constraint, where NDP ......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
We consider the online multiple Steiner Traveling Salesman Problem based on the background of the delivery of packages in an urban traffic network. In......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
We consider a classical principal-agent model in the contract theory. A principal designs the payment w = {omega(0), omega(1), ..., omega(n)) to incen......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
We consider the capacitated inverse optimal value problem on minimum spanning tree under Hamming distance. Given a connected undirected network G = (V......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
Facility location problem is a well established research area within Operations Research. Capacitated facility location problem is one of the most imp......
期刊： JOURNAL OF COMBINATORIAL OPTIMIZATION, ; ()
Recycling of end-of-life (EOL) products has drawn much attention from both researchers and practitioners over the recent decades due to the environmen......
