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.

2019, volume 37, articles 4

Improved PTAS for the constrained k-means problem pp. 1091-1110

Qilong Feng, Jiaxin Hu, Neng Huang and Jianxin Wang

Approximation algorithms for distance constraint sweep coverage with base stations pp. 1111-1125

Jian Liang, Xiaohui Huang and Zhao Zhang

Improved bounds for the greedy strategy in optimization problems with curvature pp. 1126-1149

Yajing Liu, Edwin K. P. Chong and Ali Pezeshki

On the complexity of restoring corrupted colorings pp. 1150-1169

Marzio Biasi and Juho Lauri

An approximation algorithm for genome sorting by reversals to recover all adjacencies pp. 1170-1190

Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu and Guohui Lin

Verifying a scheduling protocol of safety-critical systems pp. 1191-1215

Meng Wang, Cong Tian, Nan Zhang, Zhenhua Duan and Hongwei Du

A new look at the returning secretary problem pp. 1216-1236

J. M. Grau Ribas

Speech corpora subset selection based on time-continuous utterances features pp. 1237-1248

Luobing Dong, Qiumin Guo and Weili Wu

Balanced tree partition problems with virtual nodes pp. 1249-1265

Baoling Ning, Jianzhong Li and Shouxu Jiang

Speed scaling on parallel processors with migration pp. 1266-1282

Eric Angel, Evripidis Bampis, Fadi Kacem and Dimitrios Letsios

Positive-instance driven dynamic programming for treewidth pp. 1283-1311

Hisao Tamaki

LP-based pivoting algorithm for higher-order correlation clustering pp. 1312-1326

Takuro Fukunaga

On the 2-rainbow domination stable graphs pp. 1327-1341

Zepeng Li, Zehui Shao, Pu Wu and Taiyin Zhao

Independence and matching number of some graphs pp. 1342-1350

Ming Chen, Yusheng Li and Yiting Yang

On operations preserving semi-transitive orientability of graphs pp. 1351-1366

Ilkyoo Choi, Jinha Kim and Minki Kim

Estimating the number of basins of attraction of multi-objective combinatorial problems pp. 1367-1407

Madalina M. Drugan

Efficient algorithms for computing one or two discrete centers hitting a set of line segments pp. 1408-1423

Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng and Binhai Zhu

2019, volume 37, articles 3

Operating room planning and surgical case scheduling: a review of literature pp. 757-805

Shuwan Zhu, Wenjuan Fan, Shanlin Yang, Jun Pei and Panos M. Pardalos

Accelerating benders decomposition: multiple cuts via multiple solutions pp. 806-826

N. Beheshti Asl and S. A. MirHassani

Pareto optimal equilibria for selfish bin packing with uniform cost sharing pp. 827-847

György Dósa and Leah Epstein

Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem pp. 848-865

Davood Shiri and F. Sibel Salman

Agreeable sets with matroidal constraints pp. 866-888

Laurent Gourvès

Client assignment problems for latency minimization pp. 889-900

Gruia Călinescu and Xiaolang Wang

Verifying schedulability of tasks in ROS-based systems pp. 901-920

Jin Cui, Cong Tian, Nan Zhang, Zhenhua Duan and Hongwei Du

A possible optimal design of one-way Hamming network H(n, 3) based on the minimum transmission latency pp. 921-934

Yanyan Wen, Guorong Chai, Qiuli Li and Zhe George Zhang

Restricted power domination and zero forcing problems pp. 935-956

Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg and Leslie Hogben

An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem pp. 957-969

Mehdi Ghiyasvand

Minimum rank and zero forcing number for butterfly networks pp. 970-988

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan and Sudeep Stephen

A note on a two-agent scheduling problem related to the total weighted late work pp. 989-999

Yuan Zhang and Jinjiang Yuan

A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k pp. 1000-1010

Jun Liang and Dingjun Lou

Drawer algorithms for 1-space bounded multidimensional hyperbox packing pp. 1011-1044

Paulina Grzegorek and Janusz Januszewski

Approximation algorithms for the graph balancing problem with two speeds and two job lengths pp. 1045-1070

Daniel R. Page and Roberto Solis-Oba

Planar graphs with $$\Delta =9$$Δ=9 are neighbor-distinguishing totally 12-colorable pp. 1071-1089

Weifan Wang, Jingjing Huo, Danjun Huang and Yiqiao Wang

2019, volume 37, articles 2

Preface to the special issue on computing and combinatorics pp. 423-423

Yixin Cao and Jianer Chen

An improved lower bound on the growth constant of polyiamonds pp. 424-438

Gill Barequet, Mira Shalah and Yufei Zheng

Local search approximation algorithms for the k-means problem with penalties pp. 439-453

Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu and Zhenning Zhang

Reconfiguration of maximum-weight b-matchings in a graph pp. 454-464

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS pp. 465-481

Sankardeep Chakraborty and Srinivasa Rao Satti

Unfolding some classes of orthogonal polyhedra of arbitrary genus pp. 482-500

Kuan-Yi Ho, Yi-Jun Chang and Hsu-Chun Yen

Efficient enumeration of non-equivalent squares in partial words with few holes pp. 501-522

Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń

Dynamic rank-maximal and popular matchings pp. 523-545

Prajakta Nimbhorkar and V. Arvind Rameshwar

Deadlock resolution in wait-for graphs by vertex/arc deletion pp. 546-562

Alan Diêgo Aurélio Carneiro, Fábio Protti and Uéverton S. Souza

Better approximability results for min–max tree/cycle/path cover problems pp. 563-578

Wei Yu and Zhaohui Liu

Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended pp. 579-600

Elena Arseneva and Evanthia Papadopoulou

Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications pp. 601-619

Wenkai Dai and Yongjie Yang

Pure Nash equilibria in restricted budget games pp. 620-638

Maximilian Drees, Matthias Feldotto, Sören Riechers and Alexander Skopalik

Agent incentives of a proportional sharing mechanism in resource sharing pp. 639-667

Zhou Chen, Yukun Cheng, Qi Qi and Xiang Yan

A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops pp. 668-684

Jianming Dong, Ruyan Jin, Jueliang Hu and Guohui Lin

On the weighted safe set problem on paths and cycles pp. 685-701

Shinya Fujita, Tommy Jensen, Boram Park and Tadashi Sakuma

Independent bondage number of a graph pp. 702-712

Bruce Priddy, Haiying Wang and Bing Wei

An improved algorithm for two stage time minimization assignment problem pp. 713-736

Ekta Jain, Kalpana Dahiya, Anuj Sharma and Vanita Verma

Strategy-proof mechanisms for obnoxious facility game with bounded service range pp. 737-755

Yukun Cheng, Qiaoming Han, Wei Yu and Guochuan Zhang

2019, volume 37, articles 1

Case Mix Index weighted multi-objective optimization of inpatient bed allocation in general hospital pp. 1-19

Jian Chang and Lingjuan Zhang

Study on specialist outpatient matching appointment and the balance matching model pp. 20-39

Ying Yang, Shoucheng Luo, Jing Fan, Xinye Zhou, Chunyu Fu and Guochun Tang

A scheduling algorithm for medical emergency rescue aircraft trajectory based on hybrid estimation and intent inference pp. 40-61

Bin Hu, Fang Pan and Lei Wang

MRI appointment scheduling with uncertain examination time pp. 62-82

Huaxin Qiu, Dujuan Wang, Yanzhang Wang and Yunqiang Yin

The medical laboratory scheduling for weighted flow-time pp. 83-94

Wenhua Li and Xing Chai

An integrated method to solve the healthcare facility layout problem under area constraints pp. 95-113

Ling Gai and Jiandong Ji

Online in-time service problem with minimal server assignment pp. 114-122

Shanxiu Jiang and Li Luo

Online scheduling for outpatient services with heterogeneous patients and physicians pp. 123-149

Huiqiao Su, Guohua Wan and Shan Wang

A comparison of fixed and variable capacity-addition policies for outpatient capacity allocation pp. 150-182

Bowen Jiang, Jiafu Tang and Chongjun Yan

Prognostics and health management of life-supporting medical instruments pp. 183-195

Cheng He, Yang Wu and Tong Chen

Real-time scheduling optimization considering the unexpected events in home health care pp. 196-220

Gang Du, Luyao Zheng and Xiaoling Ouyang

Matching patients and healthcare service providers: a novel two-stage method based on knowledge rules and OWA-NSGA-II algorithm pp. 221-247

Xi Chen, Liu Zhao, Haiming Liang and Kin Keung Lai

Influencing factors analysis and modeling of hospital-acquired infection in elderly patients pp. 248-270

Xiaohui Liu, Ni Zou, Dan Zhu and Dan Wang

Optimal arrangement of the pulmonary interventional surgeries considering timely distribution of medical consumables pp. 271-285

Huidan Lin, Qun Li, Xueguo Xu and Ping Li

Three-sided stable matching problem with two of them as cooperative partners pp. 286-292

Liwei Zhong and Yanqin Bai

Optimizing model parameter for entity summarization across knowledge graphs pp. 293-318

Jihong Yan, Chen Xu, Na Li, Ming Gao and Aoying Zhou

Two-stage medical supply chain scheduling with an assignable common due window and shelf life pp. 319-329

Long Zhang, Yuzhong Zhang and Qingguo Bai

Three-dimensional stable matching with hybrid preferences pp. 330-336

Feng Zhang, Jing Li, Junxiang Fan, Huili Shen, Jian Shen and Hua Yu

Patient scheduling in hemodialysis service pp. 337-362

Zhenyuan Liu, Jiongbing Lu, Zaisheng Liu, Guangrui Liao, Hao Howard Zhang and Junwu Dong

Two-machine flowshop scheduling in a physical examination center pp. 363-374

Yadong Wang, Baoqiang Fan, Jingang Zhai and Wei Xiong

Analysis of cough detection index based on decision tree and support vector machine pp. 375-384

Wei Gao, Wuping Bao and Xin Zhou

Large-scale medical examination scheduling technology based on intelligent optimization pp. 385-404

Jiawei Zhang, Ling Wang and Lining Xing

A combinatorial auction mechanism for surgical scheduling considering surgeon’s private availability information pp. 405-417

Lu Liu, Chun Wang and Jianjun Wang

Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016 pp. 418-422

Satoru Fujishige, A. Ridha Mahjoub and Franz Rendl