Skip to main content

Journal of Combinatorial Optimization OnlineFirst articles


A note on a two-agent scheduling problem related to the total weighted late work

We revisit a two-agent scheduling problem in which a set of jobs belonging to two agents A and B (without common jobs) will be processed on a single machine for minimizing the total weighted late work of agent A subject to the maximum cost of …


Minimum rank and zero forcing number for butterfly networks

Zero forcing is a graph propagation process introduced in quantum physics and theoretical computer science, and closely related to the minimum rank problem. The minimum rank of a graph is the smallest possible rank over all matrices described by a …


An time algorithm to solve the minimum cost tension problem

This paper presents an $$O(n(m+n\log n)\log n)$$ O ( n ( m + n log n ) log n ) time algorithm to solve the minimum cost tension problem, where n and m denote the number of nodes and number of arcs, respectively. The algorithm is inspired by Orlin …


Restricted power domination and zero forcing problems

Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of a graph is a set of vertices that observes every vertex in the …


A possible optimal design of one-way Hamming network H(n, 3) based on the minimum transmission latency

One-way Hamming network H(n, 3), namely directed Hamming network, is the cartesian product of n complete graphs $$K_{3}$$ K 3 and has been widely used in hypercube parallel computer for its high communication rate and availability. As one of the …

Aktuelle Ausgaben

Über diese Zeitschrift

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.

Weitere Informationen

Premium Partner

Neuer Inhalt

BranchenIndex Online

Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.



Product Lifecycle Management im Konzernumfeld – Herausforderungen, Lösungsansätze und Handlungsempfehlungen

Für produzierende Unternehmen hat sich Product Lifecycle Management in den letzten Jahrzehnten in wachsendem Maße zu einem strategisch wichtigen Ansatz entwickelt. Forciert durch steigende Effektivitäts- und Effizienzanforderungen stellen viele Unternehmen ihre Product Lifecycle Management-Prozesse und -Informationssysteme auf den Prüfstand. Der vorliegende Beitrag beschreibt entlang eines etablierten Analyseframeworks Herausforderungen und Lösungsansätze im Product Lifecycle Management im Konzernumfeld.
Jetzt gratis downloaden!