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.

2015, volume 30, articles 4

Preface pp. 839-840

Liwei Zhong and Guochun Tang

A note of reduced dimension optimization algorithm of assignment problem pp. 841-849

Mengzhuo Bai, Chunyang Ren and Yang Liu

Quadratic kernel-free least squares support vector machine for target diseases classification pp. 850-870

Yanqin Bai, Xiao Han, Tong Chen and Hua Yu

A two-stage method for member selection of emergency medical service pp. 871-891

Xi Chen, Zhiping Fan, Zhiwu Li, Xueliang Han, Xiao Zhang and Haochen Jia

Supply chain scheduling problem in the hospital with periodic working time on a single machine pp. 892-905

Jing Fan and Xiwen Lu

Fitting $$\alpha $$ α $$\beta $$ β -crystalline structure onto electron microscopy based on SO(3) rotation group theory pp. 906-919

Beibei Li, Zhihong Zhao, Xuan Shen, Cendi Xue and Liwei Zhong

How patient compliance impacts the recommendations for colorectal cancer screening pp. 920-937

Jing Li, Ming Dong, Yijiong Ren and Kaiqi Yin

Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process pp. 938-948

Lili Liu, Guochun Tang, Baoqiang Fan and Xingpeng Wang

Predictive-reactive scheduling for single surgical suite subject to random emergency surgery pp. 949-966

Bing Wang, Xingbao Han, Xianxia Zhang and Shaohua Zhang

Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period pp. 967-981

Dujuan Wang, Feng Liu, Yunqiang Yin, Jianjun Wang and Yanzhang Wang

Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling pp. 982-995

Shan Wang, Huiqiao Su and Guohua Wan

Optimizing word set coverage for multi-event summarization pp. 996-1015

Jihong Yan, Wenliang Cheng, Chengyu Wang, Jun Liu, Ming Gao and Aoying Zhou

A surgical scheduling method considering surgeons’ preferences pp. 1016-1026

Ying Yang, Bing Shen, Wei Gao, Yong Liu and Liwei Zhong

Patients scheduling problems with deferred deteriorated functions pp. 1027-1041

Xingong Zhang, Hui Wang and Xingpeng Wang

Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks pp. 1042-1061

Fouad Kharroubi, Jing He, Jin Tang, Ming Chen and Lin Chen

How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis pp. 1062-1076

Yinfeng Xu and Huili Zhang

Strong minimum energy $$2$$ 2 -hop rooted topology for hierarchical wireless sensor networks pp. 1077-1094

B. S. Panda and D. Pushparaj Shetty

On the $$\varvec{k}$$ k -power domination of hypergraphs pp. 1095-1106

Gerard Jennhwa Chang and Nicolas Roussel

An accelerated continuous greedy algorithm for maximizing strong submodular functions pp. 1107-1124

Zengfu Wang, Bill Moran, Xuezhi Wang and Quan Pan

Multiplicatively weighted Harary index of graphs pp. 1125-1137

Hanyuan Deng, B. Krishnakumari, Y. B. Venkatakrishnan and S. Balachandran

Generating QAP instances with known optimum solution and additively decomposable cost function pp. 1138-1172

Mădălina M. Drugan

A new bound on maximum independent set and minimum connected dominating set in unit disk graphs pp. 1173-1179

Yingfan L. Du and Hongmin W. Du

List 2-distance coloring of planar graphs pp. 1180-1195

Yuehua Bu and Xiaoyan Yan

The minimum number of hubs in networks pp. 1196-1218

Easton Li Xu and Guangyue Han

An incremental version of the k-center problem on boundary of a convex polygon pp. 1219-1227

Hai Du, Yinfeng Xu and Binhai Zhu

2015, volume 30, articles 3

Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals pp. 403-412

Imed Kacem, Hans Kellerer and Yann Lanuel

An efficient meta-heuristic algorithm for grid computing pp. 413-434

Zahra Pooranian, Mohammad Shojafar, Jemal H. Abawajy and Ajith Abraham

Some results on the reciprocal sum-degree distance of graphs pp. 435-446

Guifu Su, Liming Xiong, Xiaofeng Su and Xianglian Chen

An improved lower bound for approximating the Minimum Integral Solution Problem with Preprocessing over $$\ell _\infty $$ ℓ ∞ norm pp. 447-455

Wenbin Chen, Lingxi Peng, Jianxiong Wang, Fufang Li, Maobin Tang, Wei Xiong and Songtao Wang

Signed Roman domination in digraphs pp. 456-467

S. M. Sheikholeslami and L. Volkmann

Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications pp. 468-488

Shuchao Li and Xian Meng

An extended approach for lifting clique tree inequalities pp. 489-519

Anja Fischer and Frank Fischer

Scheduling with task replication on desktop grids: theoretical and experimental analysis pp. 520-544

Eduardo C. Xavier, Robson R. S. Peixoto and Jefferson L. M. Silveira

Online traveling salesman problem with deadlines and service flexibility pp. 545-562

Xingang Wen, Yinfeng Xu and Huili Zhang

Approximating minimum power edge-multi-covers pp. 563-578

Nachshon Cohen and Zeev Nutov

Progress on the Murty–Simon Conjecture on diameter-2 critical graphs: a survey pp. 579-595

Teresa W. Haynes, Michael A. Henning, Lucas C. Merwe and Anders Yeo

The game Grundy indices of graphs pp. 596-611

Wenchao Zhang and Xuding Zhu

A 0.5358-approximation for Bandpass-2 pp. 612-626

Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu and Guohui Lin

$$(1,0,0)$$ ( 1, 0, 0 ) -Colorability of planar graphs without prescribed short cycles pp. 627-646

Yuehua Bu, Jinghan Xu and Yingqian Wang

On improving convex quadratic programming relaxation for the quadratic assignment problem pp. 647-667

Yong Xia and Wajeb Gharibi

The Cartesian product of cycles with small 2-rainbow domination number pp. 668-674

Zofia Stȩpień, Lucjan Szymaszkiewicz and Maciej Zwierzchowski

Neighbor sum distinguishing total colorings of planar graphs pp. 675-688

Hualong Li, Laihao Ding, Bingqiang Liu and Guanghui Wang

Rank bounds for a hierarchy of Lovász and Schrijver pp. 689-709

Pratik Worah

A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm pp. 710-728

R. M. A. Silva, M. G. C. Resende and P. M. Pardalos

Co-2-plex vertex partitions pp. 729-746

Benjamin McClosky, John D. Arellano and Illya V. Hicks

A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks pp. 747-767

Thang N. Dinh, Nam P. Nguyen, Md Abdul Alim and My T. Thai

Heuristics for the data arrangement problem on regular trees pp. 768-802

Eranda Çela and Rostislav Staněk

$$L(1,1)$$ L ( 1, 1 ) -labelling of the direct product of a complete graph and a cycle pp. 803-811

Byeong Moon Kim, Yoomi Rho and Byung Chul Song

On Lagrangians of r-uniform hypergraphs pp. 812-825

Yuejian Peng, Qingsong Tang and Cheng Zhao

A unified linear-programming modeling of some topological indices pp. 826-837

Hanyuan Deng, Guihua Huang and Xiaojuan Jiang

2015, volume 30, articles 2

Single-server parallel-machine scheduling with loading and unloading times pp. 201-213

Yiwei Jiang, Qinghui Zhang, Jueliang Hu, Jianming Dong and Min Ji

An improved exact algorithm for undirected feedback vertex set pp. 214-241

Mingyu Xiao and Hiroshi Nagamochi

An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities pp. 242-252

Sheng Yu

Using basis dependence distance vectors in the modified Floyd–Warshall algorithm pp. 253-275

Włodzimierz Bielecki, Krzysztof Kraska and Tomasz Klimek

Online bin packing with (1,1) and (2, $$R$$ R ) bins pp. 276-298

Jing Chen, Xin Han, Kazuo Iwama and Hing-Fung Ting

An extended strange planet protocol pp. 299-319

Jin Liu, Zhenhua Duan, Cong Tian and Nan Zhang

Robust optimization for the hazardous materials transportation network design problem pp. 320-334

Chunlin Xin, Letu Qingge, Jiamin Wang and Binhai Zhu

Prompt mechanism for online auctions with multi-unit demands pp. 335-346

Xiangzhong Xiang

Online scheduling on two parallel machines with release dates and delivery times pp. 347-359

Peihai Liu and Xiwen Lu

NF-based algorithms for online bin packing with buffer and bounded item size pp. 360-369

Feifeng Zheng, Li Luo and E. Zhang

On the clustered Steiner tree problem pp. 370-386

Bang Ye Wu and Chen-Wan Lin

Walking in streets with minimal sensing pp. 387-401

Azadeh Tabatabaei and Mohammad Ghodsi

2015, volume 30, articles 1

Group irregularity strength of connected graphs pp. 1-17

Marcin Anholcer, Sylwia Cichacz and Martin Milanic̆

PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs pp. 18-26

Lidong Wu, Hongwei Du, Weili Wu, Yuqing Zhu, Ailan Wang and Wonjun Lee

An algorithm for the dominator chromatic number of a tree pp. 27-33

Houcine Boumediene Merouane and Mustapha Chellali

L( $$d$$ d,1)-labelings of the edge-path-replacement by factorization of graphs pp. 34-41

Nathaniel Karst, Jessica Oehrlein, Denise Sakai Troxell and Junjie Zhu

Snakes, coils, and single-track circuit codes with spread $$k$$ k pp. 42-62

Simon Hood, Daniel Recoskie, Joe Sawada and Dennis Wong

Handling least privilege problem and role mining in RBAC pp. 63-86

Hejiao Huang, Feng Shang, Jinling Liu and Hongwei Du

An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths pp. 87-96

Marco Bender and Stephan Westphal

Better approximation algorithms for influence maximization in online social networks pp. 97-108

Yuqing Zhu, Weili Wu, Yuanjun Bi, Lidong Wu, Yiwei Jiang and Wen Xu

Game domination subdivision number of a graph pp. 109-119

O. Favaron, H. Karami and S. M. Sheikholeslami

Dual power assignment optimization and fault tolerance in WSNs pp. 120-138

Nhat X. Lam, Trac N. Nguyen, Min Kyung An and Dung T. Huynh

Radio number for the product of a path and a complete graph pp. 139-149

Byeong Moon Kim, Woonjae Hwang and Byung Chul Song

A new randomized algorithm for group testing with unknown number of defective items pp. 150-159

Yongxi Cheng, Jue Guo and Feifeng Zheng

On total colorings of 1-planar graphs pp. 160-173

Xin Zhang, Jianfeng Hou and Guizhen Liu

On the complexity of partitioning a graph into a few connected subgraphs pp. 174-187

Julien Bensmail

On the constraint length of random $$k$$ k -CSP pp. 188-200

Guangyan Zhou, Zongsheng Gao and Jun Liu