nach oben

Journal of Combinatorial Optimization

Inhalt (24 Artikel)

Single-machine scheduling with production and rejection costs to minimize the maximum earliness

Lingfa Lu, Liqi Zhang

The Weight Function Lemma for graph pebbling

Glenn Hurlbert

Two-agent scheduling of time-dependent jobs

Cheng He, Joseph Y.-T. Leung

A note on (s, t)-relaxed L(2, 1)-labeling of graphs

Taiyin Zhao, Guangmin Hu

The adjacent vertex distinguishing total chromatic numbers of planar graphs with

Xiaohan Cheng, Guanghui Wang, Jianliang Wu

Fibonacci helps to evacuate from a convex region in a grid network

Lan Qin, Yinfeng Xu

On the vertex cover problem parameterized by treewidth

Jianhua Tu, Lidong Wu, Jing Yuan, Lei Cui

Equitable vertex arboricity of 5-degenerate graphs

Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu

Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans

Jinjiang Yuan

Improved upper bound for the degenerate and star chromatic numbers of graphs

Jiansheng Cai, Xueliang Li, Guiying Yan

On the online multi-agent O–D k-Canadian Traveler Problem

Davood Shiri, F. Sibel Salman

Two efficient values of cooperative games with graph structure based on -values

Guang Zhang, Erfang Shan, Liying Kang, Yanxia Dong

Online scheduling to minimize the total weighted completion time plus the rejection cost

Ran Ma, Jinjiang Yuan

On Motzkin–Straus type results for non-uniform hypergraphs

Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao

Fractional matching preclusion of graphs

Yan Liu, Weiwei Liu

Total edge irregularity strength of accordion graphs

Muhammad Kamran Siddiqui, Deeba Afzal, Muhammad Ramzan Faisal

Distance domination in graphs with given minimum and maximum degree

Michael A. Henning, Nicolas Lichiardopol

Open Access

Recoverable robust spanning tree problem under interval uncertainty representations

Mikita Hradovich, Adam Kasperski, Paweł Zieliński

On maximum Wiener index of trees and graphs with given radius

Kinkar Ch. Das, M. J. Nadjafi-Arani

Triple-solution approach for the strip packing problem with two-staged patterns

Yi-Ping Cui, Yongwu Zhou, Yaodong Cui

A note on orientation and chromatic number of graphs

Manouchehr Zaker

Independent sets in some classes of -free graphs

T. Karthick

Task assignment in tree-like hierarchical structures

Cem Evrendilek, Ismail Hakki Toroslu, Seyedsasan Hashemikhabir

Matching and domination numbers in r-uniform hypergraphs

Liying Kang, Shan Li, Yanxia Dong, Erfang Shan

Aktuelle Ausgaben

Scrollen für mehr

Benutzen Sie die Pfeiltasten für mehr

Scrollen oder Pfeiltasten für mehr

Springer Professional