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 38, articles 4

Minimum cost stability in exchange networks pp. 987-1004

Yuqing Zhu, Ruidong Yan and Deying Li

Capacitated partial inverse maximum spanning tree under the weighted Hamming distance pp. 1005-1018

Xianyue Li, Xichao Shu, Huijing Huang and Jingjing Bai

Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks pp. 1019-1042

Chuanwen Luo, Yongcai Wang, Yi Hong, Wenping Chen, Xingjian Ding, Yuqing Zhu and Deying Li

Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function pp. 1043-1065

Kenjiro Takazawa

MapReduce machine covering problem on a small number of machines pp. 1066-1076

Yiwei Jiang, Ping Zhou and Wei Zhou

Antimagic orientations for the complete k-ary trees pp. 1077-1085

Chen Song and Rong-Xia Hao

Multiple Canadians on the road: minimizing the distance competitive ratio pp. 1086-1100

Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel and Joanna Tomasik

Minimum budget for misinformation blocking in online social networks pp. 1101-1127

Canh V. Pham, Quat V. Phu, Huan X. Hoang, Jun Pei and My T. Thai

The $$\alpha $$ α -spectral radius of uniform hypergraphs concerning degrees and domination number pp. 1128-1142

Qiannan Wang, Liying Kang, Erfang Shan and Zuosong Liang

Fractional matching preclusion of the restricted HL-graphs pp. 1143-1154

Shunzhe Zhang, Huiqing Liu, Dong Li and Xiaolan Hu

On the approximability of the two-phase knapsack problem pp. 1155-1179

Kameng Nip and Zhenbo Wang

Node set optimization problem for complete Josephus cubes pp. 1180-1195

Micheal Arockiaraj, Jessie Abraham and Arul Jeya Shalini

Approximation of Steiner forest via the bidirected cut relaxation pp. 1196-1212

Ali Çivril

Random walk’s correlation function for multi-objective NK landscapes and quadratic assignment problem pp. 1213-1262

Madalina M. Drugan

Information security decisions for two firms in a market with different types of customers pp. 1263-1285

Xiaofei Qian, Jun Pei, Xinbao Liu, Mi Zhou and Panos M. Pardalos

Orderings of a class of trees with respect to the Merrifield–Simmons index and the Hosoya index pp. 1286-1295

Wenwen Tian, Fei Zhao, Zheng Sun, Xuesong Mei and Guangde Chen

On the maximum size of subfamilies of labeled set with given matching number pp. 1296-1304

Huajun Zhang

2019, volume 38, articles 3

Extremal digraphs for an upper bound on the Roman domination number pp. 667-679

Lyes Ouldrabah, Mostafa Blidia and Ahmed Bouchou

On the k-domination number of digraphs pp. 680-688

Lyes Ouldrabah, Mostafa Blidia and Ahmed Bouchou

Improved approximation algorithms for the combination problem of parallel machine scheduling and path pp. 689-697

Li Guan, Jianping Li, Weidong Li and Junran Lichen

Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs pp. 698-711

Yuan Gao and Jinjiang Yuan

On perfect Roman domination number in trees: complexity and bounds pp. 712-720

Mahsa Darkooti, Abdollah Alhevaz, Sadegh Rahimi and Hadi Rahbani

A new lower bound on the domination number of a graph pp. 721-738

Majid Hajian, Michael A. Henning and Nader Jafari Rad

Packing parameters in graphs: new bounds and a solution to an open problem pp. 739-747

Doost Ali Mojdeh and Babak Samadi

Hybrid algorithms for placement of virtual machines across geo-separated data centers pp. 748-793

Fernando Stefanello, Vaneet Aggarwal, Luciana S. Buriol and Mauricio G. C. Resende

The clique-perfectness and clique-coloring of outer-planar graphs pp. 794-807

Zuosong Liang, Erfang Shan and Liying Kang

An evolutionary approach for the target search problem in uncertain environment pp. 808-835

M. Barkaoui, J. Berger and A. Boukhtouta

2-Rainbow domination stability of graphs pp. 836-845

Zepeng Li, Zehui Shao and Shou-jun Xu

A lower bound for online rectangle packing pp. 846-866

Leah Epstein

Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach pp. 867-886

Gergely Kovács, Benedek Nagy and Béla Vizvári

Characterizations of matroids with an element lying in a restricted number of circuits pp. 887-910

Ping Li, Lan Wang, Yang Wu and Hong-Jian Lai

Semipaired domination in maximal outerplanar graphs pp. 911-926

Michael A. Henning and Pawaton Kaemawichanurat

Integer programming formulations for the shared multicast tree problem pp. 927-956

Marika Ivanova and Dag Haugland

Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection pp. 957-971

Shi-Sheng Li, Ren-Xia Chen, Qi Feng and Cheng-Wen Jiao

Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks pp. 972-986

Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu and Jou-Ming Chang

2019, volume 38, articles 2

On two conjectures concerning total domination subdivision number in graphs pp. 333-340

Rana Khoeilar, Hossein Karami and Seyed Mahmoud Sheikholeslami

A linear time–cost tradeoff problem with multiple milestones under a comb graph pp. 341-361

Byung-Cheon Choi and Changmuk Kang

Parameterized Mixed Graph Coloring pp. 362-374

Peter Damaschke

Approximation algorithms for Median Hub Location Problems pp. 375-401

Marcelo P. L. Benedito and Lehilton L. C. Pedrosa

A temporal logic programming approach to planning pp. 402-420

Kai Yang, Cong Tian, Nan Zhang, Zhenhua Duan and Hongwei Du

On the extremal cacti of given parameters with respect to the difference of zagreb indices pp. 421-442

Shuchao Li, Licheng Zhang and Minjie Zhang

Minimum Szeged index among unicyclic graphs with perfect matchings pp. 443-455

Hechao Liu, Hanyuan Deng and Zikai Tang

The edge coloring game on trees with the number of colors greater than the game chromatic index pp. 456-480

Wai Lam Fong and Wai Hong Chan

Clustering without replication in combinatorial circuits pp. 481-501

Zola Donovan, Gregory Gutin, Vahan Mkrtchyan and K. Subramani

Gene tree reconciliation including transfers with replacement is NP-hard and FPT pp. 502-544

Damir Hasić and Eric Tannier

Optimal r-dynamic coloring of sparse graphs pp. 545-555

Dan Yi, Junlei Zhu, Lixia Feng, Jiaxin Wang and Mengyini Yang

The eigenvectors to the p-spectral radius of general hypergraphs pp. 556-569

Liying Kang, Lele Liu and Erfang Shan

The rank of a complex unit gain graph in terms of the rank of its underlying graph pp. 570-588

Yong Lu, Ligong Wang and Qiannan Zhou

A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs pp. 589-607

Jun Liang, Dingjun Lou, Zongrong Qin and Qinglin Yu

A tight linear time $$\frac{13}{12}$$ 13 12 -approximation algorithm for the $$P2 || C_{\max }$$ P 2 | | C max problem pp. 608-617

Federico Della Croce, Rosario Scatamacchia and Vincent T’kindt

Approximation algorithm for squared metric two-stage stochastic facility location problem pp. 618-634

Jin Zhang, Min Li, Yishui Wang, Chenchen Wu and Dachuan Xu

The connected vertex cover problem in k-regular graphs pp. 635-645

Yuchao Li, Wei Wang and Zishen Yang

Jointly stable matchings pp. 646-665

Shuichi Miyazaki and Kazuya Okamoto

2019, volume 38, articles 1

Maximizing profit of multiple adoptions in social networks with a martingale approach pp. 1-20

Bin Liu, Yuxia Yan, Qizhi Fang, Junyu Dong, Weili Wu and Huijuan Wang

Robust multiobjective portfolio optimization: a set order relations approach pp. 21-49

Chen Chen and Yu Wei

Minmax scheduling problems with common due-date and completion time penalty pp. 50-71

Baruch Mor

Hitting a path: a generalization of weighted connectivity via game theory pp. 72-85

Dávid Szeszlér

The Best-or-Worst and the Postdoc problems with random number of candidates pp. 86-110

L. Bayón, P. Fortuny, J. Grau, A. M. Oller-Marcén and M. M. Ruiz

Two-stage stochastic days-off scheduling of multi-skilled analysts with training options pp. 111-129

Douglas S. Altner, Erica K. Mason and Les D. Servi

Efficient closed domination in digraph products pp. 130-149

Iztok Peterin and Ismael G. Yero

An improved approximation algorithm for the minimum 3-path partition problem pp. 150-164

Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu and An Zhang

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem pp. 165-184

Mattia D’Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci and Guido Proietti

Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 pp. 185-196

Yulin Chang, Qiancheng Ouyang and Guanghui Wang

Optimal channel assignment with list-edge coloring pp. 197-207

Huijuan Wang, Panos M. Pardalos and Bin Liu

Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update pp. 208-223

Jianming Zhu, Shuyue Liu and Smita Ghosh

Online interval scheduling on two related machines: the power of lookahead pp. 224-253

Nicolas Pinson and Frits C. R. Spieksma

On the randomized online strategies for the k-Canadian traveler problem pp. 254-267

Davood Shiri and F. Sibel Salman

Skew-rank of an oriented graph and independence number of its underlying graph pp. 268-277

Xueliang Li and Wen Xia

Non-adaptive group testing on graphs with connectivity pp. 278-291

Song Luo, Yuji Matsuura, Ying Miao and Maiko Shigeno

Connected power domination in graphs pp. 292-315

Boris Brimkov, Derek Mikesell and Logan Smith

Determining the interset distance pp. 316-332

Maksim Barketau