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.

2014, volume 27, articles 4

A lower bound of the surviving rate of a planar graph with girth at least seven pp. 621-642

Weifan Wang, Stephen Finbow and Ping Wang

Hardness results and approximation algorithm for total liar’s domination in graphs pp. 643-662

B. S. Panda and Satya Paul

A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design pp. 663-678

Peng Zhang

Bandwidth sums of block graphs and cacti pp. 679-687

Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo, Ji-Yin Lin and Jing-Ho Yan

Paired versus double domination in K 1,r -free graphs pp. 688-694

Paul Dorbec, Bert Hartnell and Michael A. Henning

Multiple L(j,1)-labeling of the triangular lattice pp. 695-710

Pu Zhang and Wensong Lin

Algorithms with limited number of preemptions for scheduling on parallel machines pp. 711-723

Yiwei Jiang, Zewei Weng and Jueliang Hu

Linear time-dependent constraints programming with MSVL pp. 724-766

Qian Ma and Zhenhua Duan

The cost of selfishness for maximizing the minimum load on uniformly related machines pp. 767-777

Leah Epstein, Elena Kleiman and Rob Stee

An improved algorithm for tree edit distance with applications for RNA secondary structure comparison pp. 778-797

Shihyen Chen and Kaizhong Zhang

Faster algorithm to find anti-risk path between two nodes of an undirected graph pp. 798-807

Jay Mahadeokar and Sanjeev Saxena

Solving the Multidimensional Assignment Problem by a Cross-Entropy method pp. 808-823

Duc Manh Nguyen, Hoai An Le Thi and Tao Pham Dinh

2014, volume 27, articles 3

On the performance of Scatter Search for post-enrolment course timetabling problems pp. 417-439

Ghaith Jaradat, Masri Ayob and Zulkifli Ahmad

Star list chromatic number of planar subcubic graphs pp. 440-450

Min Chen, André Raspaud and Weifan Wang

On the total outer-connected domination in graphs pp. 451-461

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

Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks pp. 462-486

Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski and Eduardo L. Pasiliao

On the approximability of positive influence dominating set in social networks pp. 487-503

Thang N. Dinh, Yilin Shen, Dung T. Nguyen and My T. Thai

An approximation algorithm for k-center problem on a convex polygon pp. 504-518

Hai Du and Yinfeng Xu

Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles pp. 519-529

Yingqian Wang and Ping Sheng

The Pfaffian property of Cartesian products of graphs pp. 530-540

Fuliang Lu and Lianzhu Zhang

A simple Byzantine Generals protocol pp. 541-544

Junxing Wang

A two-stage approach for surgery scheduling pp. 545-556

Liwei Zhong, Shoucheng Luo, Lidong Wu, Lin Xu, Jinghui Yang and Guochun Tang

On minimum balanced bipartitions of triangle-free graphs pp. 557-566

Haiyan Li, Yanting Liang, Muhuo Liu and Baogang Xu

Are there more almost separable partitions than separable partitions? pp. 567-573

Fei-Huang Chang, Hong-Bin Chen and Frank K. Hwang

Popularity at minimum cost pp. 574-596

Telikepalli Kavitha, Meghana Nasre and Prajakta Nimbhorkar

Order consolidation for hierarchical product lines pp. 597-608

Woo-Lahm Kwak and Soo Y. Chang

A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties pp. 609-620

Yu Li, Donglei Du, Naihua Xiu and Dachuan Xu

2014, volume 27, articles 2

Efficient identifications of structural similarities for graphs pp. 209-220

Zheng Fang and Jie Wang

An improved distributed data aggregation scheduling in wireless sensor networks pp. 221-240

Deying Li, Qinghua Zhu, Hongwei Du and Jianzhong Li

Signed Roman domination in graphs pp. 241-255

H. Abdollahzadeh Ahangar, Michael A. Henning, Christian Löwenstein, Yancai Zhao and Vladimir Samodivkin

A study of search algorithms’ optimization speed pp. 256-270

Andrea Valsecchi, Leonardo Vanneschi and Giancarlo Mauri

Sharp bounds of the Zagreb indices of k-trees pp. 271-291

John Estes and Bing Wei

Generalized perfect domination in graphs pp. 292-301

B. Chaluvaraju and K. A. Vidya

An efficient FPRAS type group testing procedure to approximate the number of defectives pp. 302-314

Yongxi Cheng and Yinfeng Xu

Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems pp. 315-327

Zi Xu, Donglei Du and Dachuan Xu

On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube pp. 328-344

Tzu-Liang Kung, Cheng-Kuan Lin and Lih-Hsing Hsu

Boundary graph classes for some maximum induced subgraph problems pp. 345-354

Dmitriy Malyshev

Circular L(j,k)-labeling number of direct product of path and cycle pp. 355-368

Qiong Wu, Wai Chee Shiu and Pak Kiu Sun

Total and paired domination numbers of toroidal meshes pp. 369-378

Fu-Tao Hu and Jun-Ming Xu

The adjacent vertex distinguishing total coloring of planar graphs pp. 379-396

Weifan Wang and Danjun Huang

Improvements to MCS algorithm for the maximum clique problem pp. 397-416

Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov and Panos M. Pardalos

2014, volume 27, articles 1

Preface pp. 1-2

Guohui Lin

Radiation hybrid map construction problem parameterized pp. 3-13

Chihao Zhang, Haitao Jiang and Binhai Zhu

Algorithms for local similarity between forests pp. 14-31

Zhewei Liang and Kaizhong Zhang

Minimum diameter cost-constrained Steiner trees pp. 32-48

Wei Ding and Guoliang Xue

The edge-centered surface area of the arrangement graph pp. 49-64

Eddie Cheng, Ke Qiu and Zhizhang Shen

On the generalized multiway cut in trees problem pp. 65-77

Hong Liu and Peng Zhang

On certain geometric properties of the Yao–Yao graphs pp. 78-87

Iyad A. Kanj and Ge Xia

Distance- $$d$$ independent set problems for bipartite and chordal graphs pp. 88-99

Hiroshi Eto, Fengrui Guo and Eiji Miyano

Online bottleneck matching pp. 100-114

Barbara M. Anthony and Christine Chung

On-line bin packing with restricted repacking pp. 115-131

János Balogh, József Békési, Gábor Galambos and Gerhard Reinelt

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs pp. 132-143

Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel and Daniël Paulusma

The domination number of Cartesian product of two directed paths pp. 144-151

Michel Mollard

The subdivision-constrained routing requests problem pp. 152-163

Jianping Li, Weidong Li and Junran Lichen

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width pp. 164-181

Elisabeth Günther, Felix G. König and Nicole Megow

Competitive analysis for make-to-order scheduling with reliable lead time quotation pp. 182-198

Feifeng Zheng, E. Zhang, Yinfeng Xu and Wei-Chiang Hong

Spanning 3-connected index of graphs pp. 199-208

Wei Xiong, Zhao Zhang and Hong-Jian Lai