Springer Nature
1573-2886
Bi-Monthly
0.9
1382-6905
1997
31786576000
Netherlands The
English
YES
Google Scholar
Yoka.Janssen@springernature.com
This journal advances and promotes the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals. The Journal of Combinatorial Optimization is dedicated to advancing and promoting both the theory and applications of combinatorial optimization—a multidisciplinary research area at the intersection of applied mathematics, computer science, and operations research. This field extends into various domains, including computational complexity, computational biology, communication networks, management science, machine learning and artificial intelligence. The journal encompasses complexity analysis, algorithm design, including ML-based approaches, for optimization problems, numerical experiments, and problem discovery, with practical applications in science and engineering.
A network for the transportation of supplies can be described as a rooted tree with a weight of a degree of congestion for each edge. We take the sum of root-leaf distance (SRD) on a rooted...
Multicast transmissions in coded wireless packet networks can be affected by uncertain factors such as the distance between nodes. We develop a robust optimization method to minimize the ene...
In this paper, an integrated service planning and physician scheduling problem in the outpatient department is investigated, considering the re-consultation of patients as well as multiple t...
In this paper, an extension of the minimum cost flow problem is considered in which multiple incommensurate weights are associated with each arc. In the minimum cost flow problem, flow is se...
In this study, we discuss and develop a distributionally robust joint chance-constrained optimization model and apply it for the shortest path problem under resource uncertainty. In sch a ca...
In this paper, we investigate the constrained shortest path problem where the arc resources of the problem are dependent normally distributed random variables. A model is presented to maximi...
Any set function can be decomposed into the difference of two monotone nondecreasing submodular functions. This theorem plays an important role in the set function optimization theory. In th...
In this paper, we study a dynamic operating room scheduling problem which consists of three stages. The problem simultaneously tackles the capacity allocation of operating rooms to each spec...
This paper investigates a two-competing group scheduling problem on serial-batching machines considering setup times and truncated job-dependent learning effects. The objective is to minimiz...
This paper investigates an information security game between two competitive firms in a market consisting of loyal customers and switchers. The switchers are classified into unaggressive swi...
OJSCloud offers a complete, free setup to get you publishing.
Start Your Free Journal!