Journal of Combinatorial Optimization

1997 - 2025

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

2017, volume 33, articles 4

A lower bound for the adaptive two-echelon capacitated vehicle routing problem pp. 1145-1167

Liang Song, Hao Gu and Hejiao Huang

Optimal RSUs deployment with delay bound along highways in VANET pp. 1168-1182

Chunyan Liu, Hejiao Huang and Hongwei Du

A tighter insertion-based approximation of the crossing number pp. 1183-1225

Markus Chimani and Petr Hliněný

Maximum flows in generalized processing networks pp. 1226-1256

Michael Holzhauser, Sven O. Krumke and Clemens Thielen

Lambda number for the direct product of some family of graphs pp. 1257-1265

Byeong Moon Kim, Yoomi Rho and Byung Chul Song

Paired-domination number of claw-free odd-regular graphs pp. 1266-1275

Wei Yang, Xinhui An and Baoyindureng Wu

Optimal RSUs placement with delay bounded message dissemination in vehicular networks pp. 1276-1299

Chunyan Liu, Hejiao Huang, Hongwei Du and Xiaohua Jia

Approximation of knapsack problems with conflict and forcing graphs pp. 1300-1323

Ulrich Pferschy and Joachim Schauer

On the coefficients of the independence polynomial of graphs pp. 1324-1342

Shuchao Li, Lin Liu and Yueyu Wu

Even factors of graphs pp. 1343-1353

Jian Cheng, Cun-Quan Zhang and Bao-Xuan Zhu

Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable pp. 1354-1364

Ying Bai, Xiangwen Li and Gexin Yu

A new graph parameter and a construction of larger graph without increasing radio k-chromatic number pp. 1365-1377

Ushnish Sarkar and Avishek Adhikari

Bounds for the traveling salesman paths of two-dimensional modular lattices pp. 1378-1394

Florian Pausinger

A new effective branch-and-bound algorithm to the high order MIMO detection problem pp. 1395-1410

Ye Tian, Ke Li, Wei Yang and Zhiyong Li

A new upper bound for the online square packing problem in a strip pp. 1411-1420

Guosong Yu, Yanling Mao and Jiaoliao Xiao

On irreducible no-hole L(2, 1)-coloring of subdivision of graphs pp. 1421-1442

Nibedita Mandal and Pratima Panigrahi

The (vertex-)monochromatic index of a graph pp. 1443-1453

Xueliang Li and Di Wu

A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance pp. 1454-1468

Baruch Mor and Gur Mosheiov

The solution of a generalized secretary problem via analytic expressions pp. 1469-1491

Adam Woryna

2017, volume 33, articles 3

Polynomial-time approximation algorithms for the coloring problem in some cases pp. 809-813

D. S. Malyshev

The triangle k-club problem pp. 814-846

Filipa D. Carvalho and Maria Teresa Almeida

A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable pp. 847-865

Miao Zhang, Min Chen and Yiqiao Wang

Total completion time minimization in online hierarchical scheduling of unit-size jobs pp. 866-881

Jueliang Hu, Yiwei Jiang, Ping Zhou, An Zhang and Qinghui Zhang

Possible winner problems on partial tournaments: a parameterized study pp. 882-896

Yongjie Yang and Jiong Guo

On the odd girth and the circular chromatic number of generalized Petersen graphs pp. 897-923

Amir Daneshgar and Meysam Madani

Packing spanning trees and spanning 2-connected k-edge-connected essentially $$(2k-1)$$ ( 2 k - 1 ) -edge-connected subgraphs pp. 924-933

Xiaofeng Gu

Scheduling with release times and rejection on two parallel machines pp. 934-944

Xueling Zhong, Zhangming Pan and Dakui Jiang

Two-agent scheduling problems on a single-machine to minimize the total weighted late work pp. 945-955

Zhang Xingong and Wang Yong

Construction independent spanning trees on locally twisted cubes in parallel pp. 956-967

Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang and Yue-Li Wang

A note on the annihilation number and 2-domination number of a tree pp. 968-976

Jeremy Lyle and Sean Patterson

The no-wait job shop with regular objective: a method based on optimal job insertion pp. 977-1010

Reinhard Bürgy and Heinz Gröflin

A new sufficient condition for a tree T to have the (2, 1)-total number $$\Delta +1$$ Δ + 1 pp. 1011-1020

Qiaojun Shu, Weifan Wang and Yiqiao Wang

Convex median and anti-median at prescribed distance pp. 1021-1029

K. Pravas and A. Vijayakumar

Augmenting weighted graphs to establish directed point-to-point connectivity pp. 1030-1056

Mehdy Roayaei and Mohammadreza Razzazi

Efficient reassembling of graphs, part 1: the linear case pp. 1057-1089

Assaf Kfoury and Saber Mirzaei

Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles pp. 1090-1105

Tao Wang

On the minimum routing cost clustered tree problem pp. 1106-1121

Chen-Wan Lin and Bang Ye Wu

Power load forecasting by wavelet least squares support vector machine with improved fruit fly optimization algorithm pp. 1122-1143

Niu Dongxiao, Ma Tiannan and Liu Bingyi

2017, volume 33, articles 2

Complexity properties of complementary prisms pp. 365-372

Marcio Antônio Duarte, Lucia Penso, Dieter Rautenbach and Uéverton Santos Souza

An improved parameterized algorithm for the p-cluster vertex deletion problem pp. 373-388

Bang Ye Wu and Li-Hsuan Chen

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement pp. 389-402

J. M. G. Salmerón, G. Aparicio, L. G. Casado, I. García, E. M. T. Hendrix and B. G.-Tóth

Matching colored points with rectangles pp. 403-421

L. E. Caraballo, C. Ochoa, P. Pérez-Lantero and J. Rojas-Ledesma

Maximum cardinality neighbourly sets in quadrilateral free graphs pp. 422-444

K. S. Neethi and Sanjeev Saxena

Handling precedence constraints in scheduling problems by the sequence pair representation pp. 445-472

Andrzej Kozik

An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan pp. 473-495

Manzhan Gu, Xiwen Lu and Jinwei Gu

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis pp. 496-529

Aleck Johnsen, Ming-Yang Kao and Shinnosuke Seki

Online bin packing problem with buffer and bounded size revisited pp. 530-542

Minghui Zhang, Xin Han, Yan Lan and Hing-Fung Ting

Trinque problem: covering complete graphs by plane degree-bounded hypergraphs pp. 543-550

Clément Charpentier, Sylvain Gravier and Thomas Lecorre

A heuristic for the time constrained asymmetric linear sum assignment problem pp. 551-566

Peter Brown, Yuedong Yang, Yaoqi Zhou and Wayne Pullan

A coordination mechanism for a scheduling game with parallel-batching machines pp. 567-579

Q. Q. Nong, G. Q. Fan and Q. Z. Fang

More bounds for the Grundy number of graphs pp. 580-589

Zixing Tang, Baoyindureng Wu, Lin Hu and Manoucheher Zaker

Online MapReduce scheduling problem of minimizing the makespan pp. 590-608

Cong Chen, Yinfeng Xu, Yuqing Zhu and Chengyu Sun

On (s, t)-relaxed strong edge-coloring of graphs pp. 609-625

Dan He and Wensong Lin

Resource constrained scheduling with general truncated job-dependent learning effect pp. 626-644

Hongyu He, Mengqi Liu and Ji-Bo Wang

On nonlinear multi-covering problems pp. 645-659

Reuven Cohen, Mira Gonen, Asaf Levin and Shmuel Onn

Anti-forcing spectra of perfect matchings of graphs pp. 660-680

Kai Deng and Heping Zhang

Approximation algorithms for pricing with negative network externalities pp. 681-712

Zhigang Cao, Xujin Chen, Xiaodong Hu and Changjun Wang

Roman game domination number of a graph pp. 713-725

A. Bahremandpour, S. M. Sheikholeslami and L. Volkmann

Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks pp. 726-741

Amiyne Zakouni, Jiawei Luo and Fouad Kharroubi

Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks pp. 742-778

Rafael F. Santos, Alessandro Andrioni, Andre C. Drummond and Eduardo C. Xavier

The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles pp. 779-790

Lin Sun, Xiaohan Cheng and Jianliang Wu

Approximation algorithm for partial positive influence problem in social network pp. 791-802

Yingli Ran, Zhao Zhang, Hongwei Du and Yuqing Zhu

Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence pp. 803-808

Zaixin Lu, Zhao Zhang and Weili Wu

2017, volume 33, articles 1

Anti-Ramsey coloring for matchings in complete bipartite graphs pp. 1-12

Zemin Jin and Yuping Zang

On consecutive edge magic total labelings of connected bipartite graphs pp. 13-27

Bumtle Kang, Suh-Ryung Kim and Ji Yeon Park

Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree pp. 28-34

Xiao Wang and Baoyindureng Wu

On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches pp. 35-59

Vicky Mak-Hau

Benders decomposition for set covering problems pp. 60-80

S. Haddadi

Lower bounds for positive semidefinite zero forcing and their applications pp. 81-105

Boting Yang

A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks pp. 106-122

Limin Wang, Wenxue Du, Zhao Zhang and Xiaoyan Zhang

Erdős–Gallai-type results for colorful monochromatic connectivity of a graph pp. 123-131

Qingqiong Cai, Xueliang Li and Di Wu

A novel approach for detecting multiple rumor sources in networks with partial observations pp. 132-146

Zhao Zhang, Wen Xu, Weili Wu and Ding-Zhu Du

A linear-time algorithm for clique-coloring problem in circular-arc graphs pp. 147-155

Zuosong Liang, Erfang Shan and Yuzhong Zhang

Coupon coloring of some special graphs pp. 156-164

Yongtang Shi, Meiqin Wei, Jun Yue and Yan Zhao

Total weight choosability of Mycielski graphs pp. 165-182

Yunfang Tang and Xuding Zhu

A computational approach to the multi-period many-to-one matching with ties pp. 183-201

Xinsheng Xiong, Yong Zhao and Yang Chen

On the b-coloring of tight graphs pp. 202-214

Mekkia Kouider and Mohamed Zamime

Almost separable matrices pp. 215-236

Matthew Aldridge, Leonardo Baldassini and Karen Gunderson

Neighbor product distinguishing total colorings pp. 237-253

Tong Li, Cunquan Qu, Guanghui Wang and Xiaowei Yu

Code for polyomino and computer search of isospectral polyominoes pp. 254-264

Xiaodong Liang, Rui Wang and Ji xiang Meng

Total coloring of planar graphs without adjacent short cycles pp. 265-274

Huijuan Wang, Bin Liu, Yan Gu, Xin Zhang, Weili Wu and Hongwei Gao

A solution to a conjecture on the generalized connectivity of graphs pp. 275-282

Lily Chen, Xueliang Li, Mengmeng Liu and Yaping Mao

On the difference of two generalized connectivities of a graph pp. 283-291

Yuefang Sun and Xueliang Li

Broadcasting on cactus graphs pp. 292-316

Maja Čevnik and Janez Žerovnik

On (p, 1)-total labelling of planar graphs pp. 317-325

Lin Sun and Jian-Liang Wu

Maximal independent sets in a generalisation of caterpillar graph pp. 326-332

K. S. Neethi and Sanjeev Saxena

Graphs with multiplicative vertex-coloring 2-edge-weightings pp. 333-338

Joanna Skowronek-Kaziów

Minimized-cost cube query on heterogeneous information networks pp. 339-364

Dan Yin, Hong Gao, Zhaonian Zou and Jianzhong Li