Skip to main content


Journal of Combinatorial Optimization

Journal of Combinatorial Optimization OnlineFirst articles


Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications

We study the reoptimization of the Minimum Latency problem (MLP) in metric space with respect to the modifications of adding (resp. removing) a vertex and increasing (resp. decreasing) the cost of an edge $$e^*$$ e ∗ . We provide 7 / …


New bounds for locally irregular chromatic index of bipartite and subcubic graphs

A graph is locally irregular if the neighbors of every vertex v have degrees distinct from the degree of v. A locally irregular edge-coloring of a graph G is an (improper) edge-coloring such that the graph induced on the edges of any color class …


List 2-distance -coloring of planar graphs without 4,5-cycles

Let $$\chi _2(G)$$ χ 2 ( G ) and $$\chi _2^l(G)$$ χ 2 l ( G ) be the 2-distance chromatic number and list 2-distance chromatic number of a graph G, respectively. Wegner conjectured that for each planar graph G with maximum degree $$\varDelta $$ Δ …


Agent incentives of a proportional sharing mechanism in resource sharing

In a resource sharing system, resources are shared among multiple interconnected peers. Peers act as both suppliers and customers of resources by making a certain amount of their resources directly available to other network participants. Their …


On the weighted safe set problem on paths and cycles

Let G be a graph, and let w be a positive real-valued weight function on V(G). For every subset X of V(G), let $$w(X)=\sum _{v \in X} w(v)$$ w ( X ) = ∑ v ∈ X w ( v ) . A non-empty subset $$S \subset V(G)$$ S ⊂ V ( G ) is a weighted safe set of …

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!