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.

2020, volume 39, articles 4

An efficient local search algorithm for solving maximum edge weight clique problem in large graphs pp. 933-954

Yi Chu, Boxiao Liu, Shaowei Cai, Chuan Luo and Haihang You

Co-density and fractional edge cover packing pp. 955-987

Qiulan Zhao, Zhibin Chen and Jiajun Sang

On the robustness of a synchronized multi-robot system pp. 988-1016

Sergey Bereg, Andrew Brunner, Luis-Evaristo Caraballo, José-Miguel Díaz-Báñez and Mario A. Lopez

Maximum independent and disjoint coverage pp. 1017-1037

Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit and Jagpreet Singh

Neighbour-distinguishing labellings of powers of paths and powers of cycles pp. 1038-1059

Atílio G. Luiz, C. N. Campos, Simone Dantas and Diana Sasaki

Two-machine flow shop scheduling with an operator non-availability period to minimize makespan pp. 1060-1078

Dawei Li and Xiwen Lu

Stabilizing social structure via modifying local patterns pp. 1079-1095

Sajjad Salehi and Fattaneh Taghiyareh

The quadratic cycle cover problem: special cases and efficient bounds pp. 1096-1128

Frank Meijer and Renata Sotirov

Local antimagic orientation of graphs pp. 1129-1152

Yulin Chang, Fei Jing and Guanghui Wang

Efficient reassembling of three-regular planar graphs pp. 1153-1207

Assaf Kfoury and Laura Sisson

A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice pp. 1208-1220

Qingqin Nong, Jiazhu Fang, Suning Gong, Dingzhu Du, Yan Feng and Xiaoying Qu

2020, volume 39, articles 3

Bicriteria scheduling of equal length jobs on uniform parallel machines pp. 637-661

Qiulan Zhao and Jinjiang Yuan

The complexity of symmetric connectivity in directional wireless sensor networks pp. 662-686

Tien Tran and Dung T. Huynh

Compact quadratizations for pseudo-Boolean functions pp. 687-707

Endre Boros, Yves Crama and Elisabeth Rodríguez-Heck

Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles pp. 708-724

Feifeng Zheng, Yaxin Pang, Ming Liu and Yinfeng Xu

A primal-dual algorithm for the minimum partial set multi-cover problem pp. 725-746

Yingli Ran, Yishuo Shi, Changbing Tang and Zhao Zhang

Algorithmic and complexity aspects of problems related to total Roman domination for graphs pp. 747-763

Abolfazl Poureidi and Nader Jafari Rad

Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights pp. 764-775

Vincent T’kindt, Lei Shang and Federico Della Croce

On reduced second Zagreb index pp. 776-791

Lkhagva Buyantogtokh, Batmend Horoldagva and Kinkar Chandra Das

Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation pp. 792-825

Rupaj Kumar Nayak and Nirmalya Kumar Mohanty

Linear time algorithms for finding independent spanning trees on pyramid networks pp. 826-848

Shuo-I Wang and Fu-Hsing Wang

Marginal contributions and derivatives for set functions in cooperative games pp. 849-858

Daniel Li Li and Erfang Shan

On the sizes of bi-k-maximal graphs pp. 859-873

Liqiong Xu, Yingzhi Tian and Hong-Jian Lai

Contrast in greyscales of graphs pp. 874-898

Natalia Castro, María A. Garrido-Vizuete, Rafael Robles and María Trinidad Villar-Liñán

3D camera sensor scheduling algorithms for indoor multi-objective tracking pp. 899-914

Yi Hong, Yongcai Wang, Yuqing Zhu, Deying Li, Zhibo Chen and Jing Li

Fractional matching preclusion number of graphs and the perfect matching polytope pp. 915-932

Ruizhi Lin and Heping Zhang

2020, volume 39, articles 2

Price of dependence: stochastic submodular maximization with dependent items pp. 305-314

Shaojie Tang

The average covering tree value for directed graph games pp. 315-333

Anna Khmelnitskaya, Özer Selçuk and Adolphus Talman

On the edge metric dimension of convex polytopes and its related graphs pp. 334-350

Yuezhong Zhang and Suogang Gao

The Wiener index of hypergraphs pp. 351-364

Xiangxiang Liu, Ligong Wang and Xihe Li

On the zero forcing number of a graph involving some classical parameters pp. 365-384

Shuchao Li and Wanting Sun

A new approximate cluster deletion algorithm for diamond-free graphs pp. 385-411

Sabrine Malek and Wady Naanaa

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree pp. 412-424

H. Hocquard and J. Przybyło

Domination and matching in power and generalized power hypergraphs pp. 425-436

Yanxia Dong, Moo Young Sohn and Zuosong Liang

Nontrivial path covers of graphs: existence, minimization and maximization pp. 437-456

Renzo Gómez and Yoshiko Wakabayashi

Degree bounded bottleneck spanning trees in three dimensions pp. 457-491

Patrick J. Andersen and Charl J. Ras

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem pp. 492-508

Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang and Yujie Zheng

A new upper bound on the work function algorithm for the k-server problem pp. 509-518

Wenming Zhang and Yongxi Cheng

Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain pp. 519-546

Chunmei Ma and Dan Huang

A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm pp. 547-580

Wenjuan Fan, Yi Wang, Tongzhu Liu and Guixian Tong

Equitable partition of graphs into induced linear forests pp. 581-588

Xin Zhang and Bei Niu

On alternating paths and the smallest positive eigenvalue of trees pp. 589-601

Sonu Rani and Sasmita Barik

A new leader guided optimization for the flexible job shop problem pp. 602-617

Fraj Naifar, Mariem Gzara and Moalla Taicir Loukil

Local search strikes again: PTAS for variants of geometric covering and packing pp. 618-635

Pradeesha Ashok, Aniket Basu Roy and Sathish Govindarajan

2020, volume 39, articles 1

Approximation algorithms for two-stage flexible flow shop scheduling pp. 1-14

Minghui Zhang, Yan Lan and Xin Han

The seeding algorithm for k-means problem with penalties pp. 15-32

Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang and Peng Zhang

Less is more approach for competing groups scheduling with different learning effects pp. 33-54

Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang and Panos M. Pardalos

Graphs with equal domination and covering numbers pp. 55-71

Andrzej Lingas, Mateusz Miotk, Jerzy Topp and Paweł Żyliński

Neighbor product distinguishing total colorings of 2-degenerate graphs pp. 72-76

Enqiang Zhu, Chanjuan Liu and Jiguo Yu

Bounds on upper transversals in hypergraphs pp. 77-89

Michael A. Henning and Anders Yeo

Algorithmic results on double Roman domination in graphs pp. 90-114

S. Banerjee, Michael A. Henning and D. Pradhan

On the extremal graphs with respect to the total reciprocal edge-eccentricity pp. 115-137

Lifang Zhao, Hongshuai Li and Yuping Gao

Approximation algorithm for a generalized Roman domination problem in unit ball graphs pp. 138-148

Limin Wang, Yalin Shi, Zhao Zhang, Zan-Bo Zhang and Xiaoyan Zhang

Remarks on Barnette’s conjecture pp. 149-155

Jan Florek

Tree-coloring problems of bounded treewidth graphs pp. 156-169

Bi Li and Xin Zhang

The structure of graphs with given number of blocks and the maximum Wiener index pp. 170-184

Stéphane Bessy, François Dross, Katarína Hriňáková, Martin Knor and Riste Škrekovski

Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs pp. 185-215

Shuwan Zhu, Wenjuan Fan, Tongzhu Liu, Shanlin Yang and Panos M. Pardalos

Efficient algorithms for measuring the funnel-likeness of DAGs pp. 216-245

Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier and Manuel Sorge

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve pp. 246-272

Jingjing Huo, Yiqiao Wang, Weifan Wang and Wenjing Xia

On the König deficiency of zero-reducible graphs pp. 273-292

Miklós Bartha and Miklós Krész

Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 pp. 293-303

Chao Song and Changqing Xu