A unifying model for locally constrained spanning tree problems
Authors (first, second and last of 4)

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.
As a result of the significant disruption that is being caused by the COVID-19 pandemic we are very aware that many researchers will have difficulty in meeting the timelines associated with our peer review process during normal times. Please do let us know if you need additional time. Our systems will continue to remind you of the original timelines but we intend to be highly flexible at this time.
Guest Editors: Reneta Barneva (SUNY at Fredonia, USA) and Tibor Lukić (University of Novi Sad, Serbia)
Submission Deadline: October 15, 2020
The main objective of this special issue is to stimulate researchers to advance the theory of combinatorial optimization and its implementation in developing novel machine intelligence for imaging sciences. Authors are expected to propose original ideas and develop new techniques, structural results, and algorithms that improve researchers’ ability to solve practical problems.
© Springer Science+Business Media, LLC, part of Springer Nature