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

Lower bounds for independence numbers of some locally sparse graphs pp. 717-725

Yusheng Li and Qizhong Lin

Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees pp. 726-747

Asaf Levin and Uri Yovel

2-Rainbow domination number of Cartesian products: $$C_{n}\square C_{3}$$ and $$C_{n}\square C_{5}$$ pp. 748-755

Zofia Stępień and Maciej Zwierzchowski

Strategyproof mechanism design for facility location games with weighted agents on a line pp. 756-773

Qiang Zhang and Minming Li

Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ -colorable pp. 774-786

Lingji Xu, Zhengke Miao and Yingqian Wang

$$\lambda $$ -numbers of several classes of snarks pp. 787-799

Dengju Ma, Hengfeng Zhu and Jianbao He

Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion pp. 800-813

Hsing-Yen Ann, Chang-Biau Yang and Chiou-Ting Tseng

On metric dimension of permutation graphs pp. 814-826

Michael Hallaway, Cong X. Kang and Eunjeong Yi

2-Distance paired-dominating number of graphs pp. 827-836

Kan Yu and Mei Lu

Algorithms for the minimum diameter terminal Steiner tree problem pp. 837-853

Wei Ding and Ke Qiu

An upper bound of Heilbronn number for eight points in triangles pp. 854-874

Liangyu Chen, Zhenbing Zeng and Wei Zhou

Online scheduling with rejection and reordering: exact algorithms for unit size jobs pp. 875-892

Leah Epstein and Hanan Zebedat-Haider

Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five pp. 893-909

Chengchao Yan, Danjun Huang, Dong Chen and Weifan Wang

Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable pp. 910-916

Chenxia Zhao and Xianyue Li

2014, volume 28, articles 3

Preface pp. 511-512

M. T. Thai and T. N. Dinh

A nature-inspired influence propagation model for the community expansion problem pp. 513-528

Yuanjun Bi, Weili Wu, Yuqing Zhu, Lidan Fan and Ailian Wang

An individual-based model of information diffusion combining friends’ influence pp. 529-539

Lidan Fan, Zaixin Lu, Weili Wu, Yuanjun Bi, Ailian Wang and Bhavani Thuraisingham

On the radius of centrality in evolving communication networks pp. 540-560

Danica Vukadinović Greetham, Zhivko Stoyanov and Peter Grindrod

Neighborhood-based uncertainty generation in social networks pp. 561-576

Meng Han, Mingyuan Yan, Jinbao Li, Shouling Ji and Yingshu Li

Computing an effective decision making group of a society using social network analysis pp. 577-587

Donghyun Kim, Deying Li, Omid Asgari, Yingshu Li, Alade O. Tokuta and Heekuck Oh

Improvement of path analysis algorithm in social networks based on HBase pp. 588-599

Yan Qiang, Bo Pei, Weili Wu, Juanjuan Zhao, Xiaolong Zhang, Yue Li and Lidong Wu

Noise-tolerance community detection and evolution in dynamic social networks pp. 600-612

Li Wang, Jiang Wang, Yuanjun Bi, Weili Wu, Wen Xu and Biao Lian

A short-term trend prediction model of topic over Sina Weibo dataset pp. 613-625

Juanjuan Zhao, Weili Wu, Xiaolong Zhang, Yan Qiang, Tao Liu and Lidong Wu

Notes on $$L(1,1)$$ and $$L(2,1)$$ labelings for $$n$$ -cube pp. 626-638

Haiying Zhou, Wai Chee Shiu and Peter Che Bor Lam

Approximability of the subset sum reconfiguration problem pp. 639-654

Takehiro Ito and Erik D. Demaine

Best routes selection in multimodal networks using multi-objective genetic algorithm pp. 655-673

Guiwu Xiong and Yong Wang

Efficient algorithms for the max $$k$$ -vertex cover problem pp. 674-691

Federico Della Croce and Vangelis Th. Paschos

Acyclic edge coloring of planar graphs without a $$3$$ 3 -cycle adjacent to a $$6$$ 6 -cycle pp. 692-715

Yiqiao Wang, Qiaojun Shu, Jian-Liang Wu and Wenwen Zhang

2014, volume 28, articles 2

Heterochromatic tree partition number in complete multipartite graphs pp. 321-340

Zemin Jin and Peipei Zhu

Linear algebraic approach to an edge-coloring result pp. 341-347

Martin Kochol

On colour-blind distinguishing colour pallets in regular graphs pp. 348-357

Jakub Przybyło

Mobile facility location: combinatorial filtering via weighted occupancy pp. 358-375

Amitai Armon, Iftah Gamzu and Danny Segev

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation pp. 376-399

Alain Billionnet, Sourour Elloumi and Amélie Lambert

$$F_{3}$$ -domination problem of graphs pp. 400-413

Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw and Jing-Ho Yan

A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority pp. 414-446

S. F. Ghannadpour, S. Noori and R. Tavakkoli-Moghaddam

Realizations of the game domination number pp. 447-461

Gašper Košmrlj

Coloring vertices of claw-free graphs in three colors pp. 462-479

Vadim Lozin and Christopher Purcell

Online graph exploration algorithms for cycles and trees by multiple searchers pp. 480-495

Yuya Higashikawa, Naoki Katoh, Stefan Langerman and Shin-ichi Tanigawa

Approximating soft-capacitated facility location problem with uncertainty pp. 496-504

Shuxin Cai, Wenguo Yang and Yaohua Tang

Graphs with small balanced decomposition numbers pp. 505-510

Hsiang-Chun Hsu and Gerard Jennhwa Chang

2014, volume 28, articles 1

Preface pp. 1-2

Sergiy Butenko, Ding-Zhu Du and Mauricio G. C. Resende

Bound and exact methods for assessing link vulnerability in complex networks pp. 3-24

T. N. Dinh, M. T. Thai and H. T. Nguyen

Recognition of overlap graphs pp. 25-37

Theodoros P. Gevezes and Leonidas S. Pitsoulis

Multi-depot vessel routing problem in a direction dependent wavefield pp. 38-57

Michael J. Hirsch, Daniel E. Schroeder, Alvaro Maggiar and Irina S. Dolinskaya

The unconstrained binary quadratic programming problem: a survey pp. 58-81

Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang and Yang Wang

Mathematical programming: Turing completeness and applications to software analysis pp. 82-104

Leo Liberti and Fabrizio Marinelli

An exact algorithm for the maximum probabilistic clique problem pp. 105-120

Zhuqi Miao, Balabhaskar Balasundaram and Eduardo L. Pasiliao

Characteristics of the maximal independent set ZDD pp. 121-139

David R. Morrison, Edward C. Sewell and Sheldon H. Jacobson

A hybrid biased random key genetic algorithm approach for the unit commitment problem pp. 140-166

L. A. C. Roque, D. B. M. M. Fontes and F. A. C. C. Fontes

On risk-averse maximum weighted subgraph problems pp. 167-185

Maciej Rysz, Mohammad Mirghorbani, Pavlo Krokhmal and Eduardo L. Pasiliao

Staying safe and visible via message sharing in online social networks pp. 186-217

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

Value-at-risk support vector machine: stability to outliers pp. 218-232

Peter Tsyurmasto, Michael Zabarankin and Stan Uryasev

An integer programming framework for critical elements detection in graphs pp. 233-273

Alexander Veremyev, Oleg A. Prokopyev and Eduardo L. Pasiliao

Minimum number of disjoint linear forests covering a planar graph pp. 274-287

Huijuan Wang, Lidong Wu, Weili Wu and Jianliang Wu

Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery pp. 288-309

Tao Zhang, W. Art Chaovalitwongse and Yuejie Zhang

A greedy algorithm for the fault-tolerant connected dominating set in a general graph pp. 310-319

Jiao Zhou, Zhao Zhang, Weili Wu and Kai Xing