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.

2016, volume 31, articles 4

An $$O(n\log n)$$ O ( n log n ) algorithm for finding edge span of cacti pp. 1373-1382

Robert Janczewski and Krzysztof Turowski

On judicious partitions of graphs pp. 1383-1398

Muhuo Liu and Baogang Xu

Acyclic coloring of graphs with some girth restriction pp. 1399-1404

Jiansheng Cai, Binlu Feng and Guiying Yan

On identifying codes in the Cartesian product of a path and a complete graph pp. 1405-1416

Jason Hedetniemi

A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem pp. 1417-1429

Dongyue Liang, Liquan Mei, James Willson and Wei Wang

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic pp. 1430-1442

Renyu Xu, Jianliang Wu and Jin Xu

Optimization techniques for robust multivariate location and scatter estimation pp. 1443-1460

C. Chatzinakos, L. Pitsoulis and G. Zioutas

Heuristics for the network design problem with connectivity requirements pp. 1461-1478

Roman E. Shangin and Panos Pardalos

The 2-surviving rate of planar graphs without 5-cycles pp. 1479-1492

Tingting Wu, Jiangxu Kong and Weifan Wang

New results on two-machine flow-shop scheduling with rejection pp. 1493-1504

Liqi Zhang, Lingfa Lu and Shisheng Li

An approximation algorithm for maximum weight budgeted connected set cover pp. 1505-1517

Yingli Ran, Zhao Zhang, Ker-I Ko and Jun Liang

On statistical bounds of heuristic solutions to location problems pp. 1518-1549

Kenneth Carling and Xiangli Meng

A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring pp. 1550-1568

Donghyun Kim, Wei Wang, Deying Li, Joong-Lyul Lee, Weili Wu and Alade O. Tokuta

Online integrated production–distribution scheduling problems without preemption pp. 1569-1585

Xin Feng, Yongxi Cheng, Feifeng Zheng and Yinfeng Xu

Equality in a bound that relates the size and the restrained domination number of a graph pp. 1586-1608

Johannes H. Hattingh and Ernst J. Joubert

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart pp. 1609-1622

Hailing Liu, Jinjiang Yuan and Wenjie Li

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks pp. 1623-1641

Kejia Zhang, Qilong Han, Guisheng Yin and Haiwei Pan

Sizes and transmissions of digraphs with a given clique number pp. 1642-1649

Zejun Huang and Huiqiu Lin

Total coloring of planar graphs without short cycles pp. 1650-1664

Hua Cai, Jianliang Wu and Lin Sun

A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations pp. 1665-1677

Larisa Komosko, Mikhail Batsyn, Pablo San Segundo and Panos M. Pardalos

On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence pp. 1678-1684

Ailian Wang, Weili Wu and Lei Cui

On the directed cut cone and polytope pp. 1685-1708

David Avis and Conor Meagher

Construction of optimal constant-dimension subspace codes pp. 1709-1719

Wayne Pullan, Xin-Wen Wu and Zihui Liu

Budget-constrained minimum cost flows pp. 1720-1745

Michael Holzhauser, Sven O. Krumke and Clemens Thielen

Pseudo-automatic beam orientations in multi-criteria intensity-modulated radiation therapy pp. 1746-1759

Ahmad-Saher Azizi-Sultan

2016, volume 31, articles 3

On Barnette’s conjecture and the $$H^{+-}$$ H + - property pp. 943-960

Jan Florek

Some extremal properties of the multiplicatively weighted Harary index of a graph pp. 961-978

Shuchao Li and Huihui Zhang

A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems pp. 979-995

Zhang Huajun, Zhao Jin and Luo Hui

Bounded information dissemination in multi-channel wireless networks pp. 996-1012

Yu Yan, Dongxiao Yu, Yuexuan Wang, Jiguo Yu and Francis C. M. Lau

A note on the minimum number of choosability of planar graphs pp. 1013-1022

Huijuan Wang, Lidong Wu, Xin Zhang, Weili Wu and Bin Liu

Optimal weight allocation in rooted trees pp. 1023-1033

Shmuel Wimer

Extended cuts pp. 1034-1044

Walid Ben-Ameur and Mohamed Didi Biha

A modified firefly algorithm based on light intensity difference pp. 1045-1060

Bin Wang, Dong-Xu Li, Jian-Ping Jiang and Yi-Huan Liao

Cardinality constraints and systems of restricted representatives pp. 1061-1089

Ioannis Mourtos

Disjunctive total domination in graphs pp. 1090-1110

Michael A. Henning and Viroshan Naicker

Implicit cover inequalities pp. 1111-1129

Agostinho Agra, Cristina Requejo and Eulália Santos

A solution to an open problem on lower against number in graphs pp. 1130-1133

Babak Samadi

On the efficiency index of a graph pp. 1134-1141

Rommel Barbosa and Peter Slater

The 3-rainbow index and connected dominating sets pp. 1142-1159

Qingqiong Cai, Xueliang Li and Yan Zhao

Optimizing some constructions with bars: new geometric knapsack problems pp. 1160-1173

S. Bereg, J. M. Díaz-Báñez, D. Flores-Peñaloza, S. Langerman, P. Pérez-Lantero and J. Urrutia

On revenue maximization with sharp multi-unit demands pp. 1174-1205

Ning Chen, Xiaotie Deng, Paul W. Goldberg and Jinshan Zhang

Improving robustness of next-hop routing pp. 1206-1220

Glencora Borradaile, W. Sean Kennedy, Gordon Wilfong and Lisa Zhang

The entire choosability of plane graphs pp. 1221-1240

Weifan Wang, Tingting Wu, Xiaoxue Hu and Yiqiao Wang

A reinforcement-learning approach for admission control in distributed network service systems pp. 1241-1268

Xiaonong Lu, Baoqun Yin and Haipeng Zhang

Linearizable special cases of the QAP pp. 1269-1279

Eranda Çela, Vladimir G. Deineko and Gerhard J. Woeginger

Improved approximation algorithms for single-tiered relay placement pp. 1280-1297

Gruia Calinescu, Benjamin Grimmer, Satyajayant Misra, Sutep Tongngam, Guoliang Xue and Weiyi Zhang

Chromatic kernel and its applications pp. 1298-1315

Hu Ding, Branislav Stojkovic, Zihe Chen, Andrew Hughes, Lei Xu, Andrew Fritz, Nitasha Sehgal, Ronald Berezney and Jinhui Xu

An improved two-machine flowshop scheduling with intermediate transportation pp. 1316-1334

Jianming Dong, Xueshi Wang, Jueliang Hu and Guohui Lin

Problem dependent optimization (PDO) pp. 1335-1344

Iliya Bluskov

Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree pp. 1345-1372

Ya-Lei Jin, Yeong-Nan Yeh and Xiao-Dong Zhang

2016, volume 31, articles 2

$$L(2,1)$$ L ( 2, 1 ) -labeling for brick product graphs pp. 447-462

Zehui Shao, Jin Xu and Roger K. Yeh

On the best possible competitive ratio for the multislope ski-rental problem pp. 463-490

Hiroshi Fujiwara, Takuma Kitano and Toshihiro Fujito

On single machine scheduling with resource constraint pp. 491-505

Lidong Wu and Cong-Dian Cheng

Integral packing of branchings in capacitaded digraphs pp. 506-514

Mario Leston-Rey

Multi-depot vehicle routing problem with time windows under shared depot resources pp. 515-532

Jian Li, Yang Li and Panos M. Pardalos

Crossing edges and faces of line arrangements in the plane pp. 533-545

Rom Pinchasi

Modified differential evolution with self-adaptive parameters method pp. 546-576

Xiangtao Li and Minghao Yin

Verifying safety critical task scheduling systems in PPTL axiom system pp. 577-603

Nan Zhang, Mengfei Yang, Bin Gu, Zhenhua Duan and Cong Tian

$$L(j,k)$$ L ( j, k ) -labeling number of Cartesian product of path and cycle pp. 604-634

Qiong Wu, Wai Chee Shiu and Pak Kiu Sun

Extremal polyomino chains with respect to general Randić index pp. 635-647

Mingqiang An and Liming Xiong

Further results on the reciprocal degree distance of graphs pp. 648-668

Shuchao Li, Huihui Zhang and Minjie Zhang

Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k, 2 ) -subgraph pp. 669-685

M. Reza Khani and Mohammad R. Salavatipour

Semi-online scheduling with combined information on two identical machines in parallel pp. 686-695

Qian Cao and Guohua Wan

Approximation algorithms for minimum weight partial connected set cover problem pp. 696-712

Dongyue Liang, Zhao Zhang, Xianliang Liu, Wei Wang and Yaolin Jiang

2-Edge connected dominating sets and 2-Connected dominating sets of a graph pp. 713-724

Hengzhe Li, Yuxing Yang and Baoyindureng Wu

Power domination with bounded time constraints pp. 725-742

Chung-Shou Liao

Team selection for prediction tasks pp. 743-757

MohammadAmin Fazli, Azin Ghazimatin, Jafar Habibi and Hamid Haghshenas

Degree-constrained orientations of embedded graphs pp. 758-773

Yann Disser and Jannik Matuschke

Scheduling dedicated jobs with variative processing times pp. 774-785

Maksim Barketau, Erwin Pesch and Yakov Shafransky

Bounding the scaling window of random constraint satisfaction problems pp. 786-801

Jing Shen and Yaofeng Ren

Algorithms for finding maximum transitive subtournaments pp. 802-814

Lasse Kiviluoto, Patric R. J. Östergård and Vesa P. Vaskelainen

Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis pp. 815-832

Chun-Ying Chiang, Wei-Ting Huang and Hong-Gwa Yeh

Two cases of polynomial-time solvability for the coloring problem pp. 833-845

D. S. Malyshev

An approximation algorithm for the partial vertex cover problem in hypergraphs pp. 846-864

Mourad El Ouali, Helena Fohlin and Anand Srivastav

$$k$$ k -Power domination in block graphs pp. 865-873

Chao Wang, Lei Chen and Changhong Lu

Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs pp. 874-880

Yi Wang, Jian Cheng, Rong Luo and Gregory Mulley

Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs pp. 881-892

Yanming Chang, Yuejian Peng and Yuping Yao

A sufficient condition for a tree to be $$(\Delta +1)$$ ( Δ + 1 ) - $$(2,1)$$ ( 2, 1 ) -totally labelable pp. 893-901

Zhengke Miao, Qiaojun Shu, Weifan Wang and Dong Chen

Acyclic 3-coloring of generalized Petersen graphs pp. 902-911

Enqiang Zhu, Zepeng Li, Zehui Shao, Jin Xu and Chanjuan Liu

Degree conditions for weakly geodesic pancyclic graphs and their exceptions pp. 912-917

Emlee W. Nicholson and Bing Wei

Evaluating entity-description conflict on duplicated data pp. 918-941

Lingli Li, Jianzhong Li and Hong Gao

2016, volume 31, articles 1

On the complexity of the minimum outer-connected dominating set problem in graphs pp. 1-12

D. Pradhan

The best choice problem for posets; colored complete binary trees pp. 13-28

Wojciech Kaźmierczak

Approximation for maximizing monotone non-decreasing set functions with a greedy method pp. 29-43

Zengfu Wang, Bill Moran, Xuezhi Wang and Quan Pan

An inequality that relates the size of a bipartite graph with its order and restrained domination number pp. 44-51

Ernst J. Joubert

Lower bounds on the total domination number of a graph pp. 52-66

Wyatt J. Desormeaux and Michael A. Henning

$$L(p,q)$$ L ( p, q ) -labeling and integer tension of a graph embedded on torus pp. 67-77

Xiaoling L. Zhang and Jianguo G. Qian

Erratum to: $$L(p, q)$$ L ( p, q ) -labeling and integer tension of a graph embedded on torus pp. 78-78

Xiaoling Zhang and Jianguo Qian

Minimax regret vertex 2-sink location problem in dynamic path networks pp. 79-94

Hongmei Li, Yinfeng Xu and Guanqun Ni

Algorithms for randomized time-varying knapsack problems pp. 95-117

Yichao He, Xinlu Zhang, Wenbin Li, Xiang Li, Weili Wu and Suogang Gao

Information exchange with collision detection on multiple channels pp. 118-135

Yuepeng Wang, Yuexuan Wang, Dongxiao Yu, Jiguo Yu and Francis C. M. Lau

A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem pp. 136-151

Yishuo Shi, Yaping Zhang, Zhao Zhang and Weili Wu

The blocking job shop with rail-bound transportation pp. 152-181

Reinhard Bürgy and Heinz Gröflin

Maximally edge-connected graphs and Zeroth-order general Randić index for $$\alpha \le -1$$ α ≤ - 1 pp. 182-195

Guifu Su, Liming Xiong, Xiaofeng Su and Guojun Li

On the computational complexity of bridgecard pp. 196-217

Zihan Tan

Polynomial algorithms for canonical forms of orientations pp. 218-222

Martin Kochol

Some Motzkin–Straus type results for non-uniform hypergraphs pp. 223-238

Ran Gu, Xueliang Li, Yuejian Peng and Yongtang Shi

1.61-approximation for min-power strong connectivity with two power levels pp. 239-259

Gruia Călinescu

Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan pp. 260-278

Kejun Zhao and Xiwen Lu

Minimum-latency aggregation scheduling in wireless sensor network pp. 279-310

Longjiang Guo, Yingshu Li and Zhipeng Cai

A simplex like approach based on star sets for recognizing convex- $$QP$$ Q P adverse graphs pp. 311-326

Domingos M. Cardoso and Carlos J. Luz

Cacti with the smallest, second smallest, and third smallest Gutman index pp. 327-332

Shubo Chen

Signed Roman edge domination numbers in graphs pp. 333-346

H. Abdollahzadeh Ahangar, J. Amjadi, S. M. Sheikholeslami, L. Volkmann and Y. Zhao

Efficient algorithms for cluster editing pp. 347-371

Lucas Bastos, Luiz Satoru Ochi, Fábio Protti, Anand Subramanian, Ivan César Martins and Rian Gabriel S. Pinheiro

An efficient algorithm for distance total domination in block graphs pp. 372-381

Yancai Zhao and Erfang Shan

Atoms of cyclic edge connectivity in regular graphs pp. 382-395

Jin-Xin Zhou

L(2,1)-labelings of the edge-multiplicity-paths-replacement of a graph pp. 396-404

Damei Lü and Jianping Sun

On $$(s,t)$$ ( s, t ) -relaxed $$L(2,1)$$ L ( 2, 1 ) -labeling of graphs pp. 405-426

Wensong Lin

Further properties on the degree distance of graphs pp. 427-446

Hongzhuan Wang and Liying Kang