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.

2022, volume 43, articles 5

A multi-period ambulance location and allocation problem in the disaster pp. 909-932

Jian Wang, Yin Wang and Mingzhu Yu

Approximation algorithms for two variants of correlation clustering problem pp. 933-952

Sai Ji, Dachuan Xu, Min Li and Yishui Wang

Reconfiguration of garbage collection system based on Voronoi graph theory: a simulation case of Beijing region pp. 953-973

Chun-lin Xin, Shuo Liang and Feng-wu Shen

Online pickup and delivery problem with constrained capacity to minimize latency pp. 974-993

Haiyan Yu, Xianwei Luo and Tengyu Wu

A general framework for path convexities pp. 994-1009

João Vinicius C. Thompson, Loana T. Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre C. Dourado and Uéverton S. Souza

Eco-friendly container transshipment route scheduling problem with repacking operations pp. 1010-1035

Ming Liu, Rongfan Liu, E Zhang and Chengbin Chu

Shortest paths among transient obstacles pp. 1036-1074

Anil Maheshwari, Arash Nouri and Jörg-Rüdiger Sack

Joint optimal pricing and advertising policies in a fashion supply chain under the ODM strategy considering fashion level and goodwill pp. 1075-1105

Qi Chen and Qi Xu

The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain pp. 1106-1124

Hui Zhang, Kai Luo and Guanqun Ni

Maximizing a monotone non-submodular function under a knapsack constraint pp. 1125-1148

Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu and Dongmei Zhang

Online machine minimization with lookahead pp. 1149-1172

Cong Chen, Huili Zhang and Yinfeng Xu

Multimode time-cost-robustness trade-off project scheduling problem under uncertainty pp. 1173-1202

Xue Li, Zhengwen He, Nengmin Wang and Mario Vanhoucke

Super-stability in the student-project allocation problem with ties pp. 1203-1239

Sofiat Olaosebikan and David Manlove

Online scheduling of car-sharing request pairs between two locations pp. 1240-1263

Kelin Luo, Yinfeng Xu and Haodong Liu

Incremental optimization of independent sets under the reconfiguration framework pp. 1264-1279

Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki

Online leasing problem with price fluctuations and the second-hand transaction pp. 1280-1297

Xin Feng and Chengbin Chu

A bi-objective decision model and method for the integrated optimization of bus line planning and lane reservation pp. 1298-1327

Peng Wu, Ling Xu, Ada Che and Feng Chu

An approximation algorithm for a general class of parametric optimization problems pp. 1328-1358

Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen and Daniel Vanderpooten

Single machine lot scheduling with non-uniform lot capacities and processing times pp. 1359-1367

Ying Chen, Yongxi Cheng and Guiqing Zhang

Weighted amplifiers and inapproximability results for Travelling Salesman problem pp. 1368-1390

Miroslav Chlebík and Janka Chlebíková

A traffic congestion analysis by user equilibrium and system optimum with incomplete information pp. 1391-1404

Qiang Zhang, Shi Qiang Liu and Mahmoud Masoud

Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity pp. 1405-1422

Wei Yu, Zhaohui Liu and Xiaoguang Bao

Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information pp. 1423-1446

Peng Hu, Feng Chu, Yunfei Fang and Peng Wu

Optimal pricing of crowdsourcing logistics services with social delivery capacity pp. 1447-1469

Wenjie Wang and Lei Xie

On the relationship between energy complexity and other boolean function measures pp. 1470-1492

Xiaoming Sun, Yuan Sun, Kewen Wu and Zhiyu Xia

Optimal conditions for connectedness of discretized sets pp. 1493-1506

Boris Brimkov and Valentin E. Brimkov

Preface pp. 1507-1508

Bo Chen, Dachuan Xu and Guochuan Zhang

Optimal Steiner trees under node and edge privacy conflicts pp. 1509-1533

Alessandro Hill, Roberto Baldacci and Stefan Voß

Smaller universal targets for homomorphisms of edge-colored graphs pp. 1534-1544

Grzegorz Guśpiel

A simple method for proving lower bounds in the zero-visibility cops and robber game pp. 1545-1570

Yuan Xue, Boting Yang and Sandra Zilles

Heuristics for cross-docking scheduling of truck arrivals, truck departures and shop-floor operations pp. 1571-1601

Feifeng Zheng, Yaxin Pang and Yinfeng Xu

Exact algorithms for scheduling programs with shared tasks pp. 1602-1627

Imed Kacem, Giorgio Lucarelli and Théo Nazé

Strategyproof mechanisms for 2-facility location games with minimax envy pp. 1628-1644

Xin Chen, Qizhi Fang, Wenjing Liu, Yuan Ding and Qingqin Nong

Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance pp. 1645-1654

Jing Fan and Hui Shi

Fast algorithms for maximizing monotone nonsubmodular functions pp. 1655-1670

Bin Liu and Miaomiao Hu

Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint pp. 1671-1690

Min Cui, Dachuan Xu, Longkun Guo and Dan Wu

2022, volume 43, articles 4

Population monotonicity in matching games pp. 699-709

Han Xiao and Qizhi Fang

Adjacent vertex distinguishing edge coloring of IC-planar graphs pp. 710-726

Zhuoya Liu and Changqing Xu

Metaheuristic algorithms for the bandwidth reduction of large-scale matrices pp. 727-784

S. L. Gonzaga de Oliveira and C. Carvalho

An ant colony optimization approach for the proportionate multiprocessor open shop pp. 785-817

Zeynep Adak, Mahmure Övül Arıoğlu and Serol Bulkan

Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution pp. 818-849

Sylvain Béal, Eric Rémila and Philippe Solal

Spanning tree of a multiple graph pp. 850-869

Alexander V. Smirnov

Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy pp. 870-908

Zhen Wang, Liwei Liu and Yiqiang Q. Zhao

2022, volume 43, articles 3

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty pp. 497-527

Marc Goerigk, Adam Kasperski and Paweł Zieliński

Linear-size universal discretization of geometric center-based problems in fixed dimensions pp. 528-542

Vladimir Shenmaier

The maximum average connectivity among all orientations of a graph pp. 543-570

Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol and Ortrud Oellermann

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph pp. 571-588

Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su and An Zhang

Advancing local search approximations for multiobjective combinatorial optimization problems pp. 589-612

Lakmali Weerasena

Lower bounds for batched bin packing pp. 613-629

János Balogh, József Békési, György Dósa, Leah Epstein and Asaf Levin

Rescheduling problems with allowing for the unexpected new jobs arrival pp. 630-645

Xingong Zhang, Win-Chin Lin and Chin-Chia Wu

A value for cooperative games with coalition and probabilistic graph structures pp. 646-671

Jilei Shi, Lei Cai, Erfang Shan and Wenrong Lyu

Adaptive online portfolio strategy based on exponential gradient updates pp. 672-696

Yong Zhang, Hong Lin, Lina Zheng and Xingyu Yang

Correction To: Solving $$(k-1)$$ ( k - 1 ) -stable instances of k-terminal cut with isolating cuts pp. 697-697

Mark Velednitsky

2022, volume 43, articles 2

Solving $$(k-1)$$ ( k - 1 ) -stable instances of k-terminal cut with isolating cuts pp. 297-311

Mark Velednitsky

Optimized threshold-based convolutional neural network for plant leaf classification: a challenge towards untrained data pp. 312-349

Bhanuprakash Dudi and V. Rajesh

A PTAS for non-resumable open shop scheduling with an availability constraint pp. 350-362

Yuan Yuan, Yan Lan, Ning Ding and Xin Han

On the complexity of minimum q-domination partization problems pp. 363-383

Sayani Das and Sounaka Mishra

Decomposability of a class of k-cutwidth critical graphs pp. 384-401

Zhen-Kun Zhang, Zhong Zhao and Liu-Yong Pang

Computing directed Steiner path covers pp. 402-431

Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann and Egon Wanke

Approximation algorithms for simple assembly line balancing problems pp. 432-443

Santiago Valdés Ravelo

Discouraging pool block withholding attacks in Bitcoin pp. 444-459

Zhihuai Chen, Bo Li, Xiaohan Shan, Xiaoming Sun and Jialin Zhang

Determining the edge metric dimension of the generalized Petersen graph P(n, 3) pp. 460-496

David G. L. Wang, Monica M. Y. Wang and Shiqiang Zhang

2022, volume 43, articles 1

Structure and pancyclicity of maximal planar graphs with diameter two pp. 1-27

Shu-Yu Cui, Yiqiao Wang, Danjun Huang, Hongwei Du and Weifan Wang

Independent domination in subcubic graphs pp. 28-41

A. Akbari, S. Akbari, A. Doosthosseini, Z. Hadizadeh, Michael A. Henning and A. Naraghi

A simple two-agent system for multi-objective flexible job-shop scheduling pp. 42-64

Yingli Li, Jiahai Wang and Zhengwei Liu

k-Wiener index of a k-plex pp. 65-78

Zhongyuan Che

Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads pp. 79-97

Baruch Mor

A new allocation rule for the housing market problem with ties pp. 98-115

Xinsheng Xiong, Xianjia Wang and Kun He

Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect pp. 116-139

Zhongyi Jiang, Fangfang Chen and Xiandong Zhang

Distributionally robust maximum probability shortest path problem pp. 140-167

Rashed Khanjani-Shiraz, Ali Babapour-Azar, Zohreh Hosseini-Noudeh and Panos M. Pardalos

A two-machine no-wait flow shop problem with two competing agents pp. 168-199

Abdennour Azerine, Mourad Boudhar and Djamal Rebaine

Some graph optimization problems with weights satisfying linear constraints pp. 200-225

Kameng Nip, Tianning Shi and Zhenbo Wang

The Steiner cycle and path cover problem on interval graphs pp. 226-234

Ante Ćustić and Stefan Lendl

Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem pp. 235-252

Jian Lin, Xiangfei Zeng, Jianxun Liu and Keqin Li

A note on maximum fractional matchings of graphs pp. 253-264

Tianlong Ma, Eddie Cheng, Yaping Mao and Xu Wang

A modified DEA cross efficiency method with negative data and its application in supplier selection pp. 265-296

Mehdi Soltanifar and Hamid Sharafi