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

Loyalty improvement beyond the seeds in social networks pp. 685-700

Huan Ma, Yuqing Zhu, Deying Li, Songsong Li and Weili Wu

Generalized Canadian traveller problems pp. 701-712

Chung-Shou Liao and Yamming Huang

The $$r$$ r -acyclic chromatic number of planar graphs pp. 713-722

Guanghui Wang, Guiying Yan, Jiguo Yu and Xin Zhang

Optimal-constrained multicast sub-graph over coded packet networks pp. 723-738

M. A. Raayatpanah, H. Salehi Fathabadi, H. Bahramgiri and P. M. Pardalos

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines pp. 739-749

Paul C. Bell and Prudence W. H. Wong

Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results pp. 750-780

Mirko Ruokokoski, Harri Ehtamo and Panos M. Pardalos

Optimal online algorithms on two hierarchical machines with tightly-grouped processing times pp. 781-795

An Zhang, Yiwei Jiang, Lidan Fan and Jueliang Hu

The minimum chromatic spectrum of 3-uniform $$\mathcal{C}$$ C -hypergraphs pp. 796-802

Ruixue Zhang, Ping Zhao, Kefeng Diao and Fuliang Lu

Complete forcing numbers of catacondensed hexagonal systems pp. 803-814

Shou-Jun Xu, Heping Zhang and Jinzhuan Cai

Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks pp. 815-835

Zhipeng Cai, Yueming Duan and Anu G. Bourgeois

The online $$k$$ k -server problem with max-distance objective pp. 836-846

Yinfeng Xu, Hongmei Li, Changzheng He and Li Luo

Parameterizations of hitting set of bundles and inverse scope pp. 847-858

Peter Damaschke

A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem pp. 859-883

Theodoros Gevezes and Leonidas Pitsoulis

2015, volume 29, articles 3

Optimal shortest path set problem in undirected graphs pp. 511-530

Huili Zhang, Yinfeng Xu and Xingang Wen

Large hypertree width for sparse random hypergraphs pp. 531-540

Tian Liu, Chaoyi Wang and Ke Xu

Zero-visibility cops and robber and the pathwidth of a graph pp. 541-564

Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach and Boting Yang

An integer programming approach for the Chinese postman problem with time-dependent travel time pp. 565-588

Jinghao Sun, Yakun Meng and Guozhen Tan

Expected computations on color spanning sets pp. 589-604

Chao Li, Chenglin Fan, Jun Luo, Farong Zhong and Binhai Zhu

Faster exact computation of rSPR distance pp. 605-635

Zhi-Zhong Chen, Ying Fan and Lusheng Wang

A set covering approach for multi-depot train driver scheduling pp. 636-654

Masoud Yaghini, Mohammad Karimi and Mohadeseh Rahbar

On $$(s,t)$$ ( s, t ) -relaxed $$L(2,1)$$ L ( 2, 1 ) -labelings of the triangular lattice pp. 655-669

Wensong Lin and Benqiu Dai

On the hardness of learning queries from tree structured data pp. 670-684

Xianmin Liu and Jianzhong Li

2015, volume 29, articles 2

The Laplacian of a uniform hypergraph pp. 331-366

Shenglong Hu and Liqun Qi

General lower bound on the size of $$(H;k)$$ -stable graphs pp. 367-372

Andrzej Żak

Two smaller upper bounds of list injective chromatic number pp. 373-388

Yuehua Bu, Kai Lu and Sheng Yang

On the $$p$$ -reinforcement and the complexity pp. 389-405

You Lu, Fu-Tao Hu and Jun-Ming Xu

Transformation from PLTL to automata via NFGs pp. 406-417

Cong Tian, Zhenhua Duan and Mengfei Yang

Network construction with subgraph connectivity constraints pp. 418-432

Dana Angluin, James Aspnes and Lev Reyzin

A tolerance-based heuristic approach for the weighted independent set problem pp. 433-450

B. I. Goldengorin, D. S. Malyshev, P. M. Pardalos and V. A. Zamaraev

Embedding signed graphs in the line pp. 451-471

Eduardo G. Pardo, Mauricio Soto and Christopher Thraves

On the complexity of connectivity in cognitive radio networks through spectrum assignment pp. 472-487

Hongyu Liang, Tiancheng Lou, Haisheng Tan, Yuexuan Wang and Dongxiao Yu

Algorithms and complexity results for labeled correlation clustering problem pp. 488-501

Xianmin Liu and Jianzhong Li

Nordhaus–Gaddum-type results for path covering and $$L(2,1)$$ -labeling numbers pp. 502-510

Damei Lü, Juan Du, Nianfeng Lin, Ke Zhang and Dan Yi

2015, volume 29, articles 1

Parametric power supply networks pp. 1-15

Shiho Morishita and Takao Nishizeki

DVS scheduling in a line or a star network of processors pp. 16-35

Zongxu Mu and Minming Li

A combination of flow shop scheduling and the shortest path problem pp. 36-52

Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon and Roel Leus

An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems pp. 53-66

Chenchen Wu, Donglei Du and Dachuan Xu

Improved lower bounds for the online bin packing problem with cardinality constraints pp. 67-87

Hiroshi Fujiwara and Koji Kobayashi

Computing the shortest reset words of synchronizing automata pp. 88-124

Andrzej Kisielewicz, Jakub Kowalski and Marek Szykuła

Randomized parameterized algorithms for $$P_2$$ P 2 -Packing and Co-Path Packing problems pp. 125-140

Qilong Feng, Jianxin Wang, Shaohua Li and Jianer Chen

Covering tree with stars pp. 141-152

Jan Baumbach, Jiong Guo and Rashid Ibragimov

Improved approximation algorithms for computing $$k$$ k disjoint paths subject to two constraints pp. 153-164

Longkun Guo, Hong Shen and Kewen Liao

On the sequential price of anarchy of isolation games pp. 165-181

Anna Angelucci, Vittorio Bilò, Michele Flammini and Luca Moscardelli

New bounds for the balloon popping problem pp. 182-196

Davide Bilò and Vittorio Bilò

Packing cubes into a cube is NP-complete in the strong sense pp. 197-215

Yiping Lu, Danny Z. Chen and Jianzhong Cha

Complexity analysis and algorithms for the Program Download Problem pp. 216-227

Chao Peng, Jie Zhou, Binhai Zhu and Hong Zhu

Online unbounded batch scheduling on parallel machines with delivery times pp. 228-236

Peihai Liu and Xiwen Lu

Improved local search for universal facility location pp. 237-246

Eric Angel, Nguyen Kim Thang and Damien Regnault

Tractable connected domination for restricted bipartite graphs pp. 247-256

Tian Liu, Zhao Lu and Ke Xu

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs pp. 257-275

Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo and Jianer Chen

The $$k$$ k -separator problem: polyhedra, complexity and approximation results pp. 276-307

Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi and José Neto

A structural transformation from p- $$\pi $$ π to MSVL pp. 308-329

Ling Luo, Zhenhua Duan, Cong Tian and Xiaobing Wang