default search action
Journal of Combinatorial Optimization, Volume 30
Volume 30, Number 1, July 2015
- Marcin Anholcer, Sylwia Cichacz, Martin Milanic:
Group irregularity strength of connected graphs. 1-17 - Lidong Wu, Hongwei Du, Weili Wu, Yuqing Zhu, Ailian Wang, Wonjun Lee:
PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs. 18-26 - Houcine Boumediene Merouane, Mustapha Chellali:
An algorithm for the dominator chromatic number of a tree. 27-33 - Nathaniel J. Karst, Jessica Oehrlein, Denise Sakai Troxell, Junjie Zhu:
L(d, 1)-labelings of the edge-path-replacement by factorization of graphs. 34-41 - Simon Hood, Daniel Recoskie, Joe Sawada, Dennis Wong:
Snakes, coils, and single-track circuit codes with spread k. 42-62 - Hejiao Huang, Feng Shang, Jinling Liu, Hongwei Du:
Handling least privilege problem and role mining in RBAC. 63-86 - Marco Bender, Stephan Westphal:
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths. 87-96 - Yuqing Zhu, Weili Wu, Yuanjun Bi, Lidong Wu, Yiwei Jiang, Wen Xu:
Better approximation algorithms for influence maximization in online social networks. 97-108 - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Game domination subdivision number of a graph. 109-119 - Nhat X. Lam, Trac N. Nguyen, Min Kyung An, Dung T. Huynh:
Dual power assignment optimization and fault tolerance in WSNs. 120-138 - Byeong Moon Kim, Woonjae Hwang, Byung Chul Song:
Radio number for the product of a path and a complete graph. 139-149 - Yongxi Cheng, Jue Guo, Feifeng Zheng:
A new randomized algorithm for group testing with unknown number of defective items. 150-159 - Xin Zhang, Jianfeng Hou, Guizhen Liu:
On total colorings of 1-planar graphs. 160-173 - Julien Bensmail:
On the complexity of partitioning a graph into a few connected subgraphs. 174-187 - Guangyan Zhou, Zongsheng Gao, Jun Liu:
On the constraint length of random k-CSP. 188-200
Volume 30, Number 2, August 2015
- Yiwei Jiang, Qinghui Zhang, Jueliang Hu, Jianming Dong, Min Ji:
Single-server parallel-machine scheduling with loading and unloading times. 201-213 - Mingyu Xiao, Hiroshi Nagamochi:
An improved exact algorithm for undirected feedback vertex set. 214-241 - Sheng Yu:
An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities. 242-252 - Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek:
Using basis dependence distance vectors in the modified Floyd-Warshall algorithm. 253-275 - Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting:
Online bin packing with (1, 1) and (2, R) bins. 276-298 - Jin Liu, Zhenhua Duan, Cong Tian, Nan Zhang:
An extended strange planet protocol. 299-319 - Chunlin Xin, Letu Qingge, Jiamin Wang, Binhai Zhu:
Robust optimization for the hazardous materials transportation network design problem. 320-334 - Xiangzhong Xiang:
Prompt mechanism for online auctions with multi-unit demands. 335-346 - Peihai Liu, Xiwen Lu:
Online scheduling on two parallel machines with release dates and delivery times. 347-359 - Feifeng Zheng, Li Luo, E. Zhang:
NF-based algorithms for online bin packing with buffer and bounded item size. 360-369 - Bang Ye Wu, Chen-Wan Lin:
On the clustered Steiner tree problem. 370-386 - Azadeh Tabatabaei, Mohammad Ghodsi:
Walking in streets with minimal sensing. 387-401
Volume 30, Number 3, October 2015
- Imed Kacem, Hans Kellerer, Yann Lanuel:
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. 403-412 - Zahra Pooranian, Mohammad Shojafar, Jemal H. Abawajy, Ajith Abraham:
An efficient meta-heuristic algorithm for grid computing. 413-434 - Guifu Su, Liming Xiong, Xiaofeng Su, Xianglian Chen:
Some results on the reciprocal sum-degree distance of graphs. 435-446 - Wenbin Chen, Lingxi Peng, Jianxiong Wang, Fufang Li, Maobin Tang, Wei Xiong, Songtao Wang:
An improved lower bound for approximating the Minimum Integral Solution Problem with Preprocessing over ℓ∞ norm. 447-455 - Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed Roman domination in digraphs. 456-467 - Shuchao Li, Xian Meng:
Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications. 468-488 - Anja Fischer, Frank Fischer:
An extended approach for lifting clique tree inequalities. 489-519 - Eduardo C. Xavier, Robson R. S. Peixoto, Jefferson L. M. da Silveira:
Scheduling with task replication on desktop grids: theoretical and experimental analysis. 520-544 - Xingang Wen, Yinfeng Xu, Huili Zhang:
Online traveling salesman problem with deadlines and service flexibility. 545-562 - Nachshon Cohen, Zeev Nutov:
Approximating minimum power edge-multi-covers. 563-578 - Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. 579-595 - Wenchao Zhang, Xuding Zhu:
The game Grundy indices of graphs. 596-611 - Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin:
A 0.5358-approximation for Bandpass-2. 612-626 - Yuehua Bu, Jinghan Xu, Yingqian Wang:
(1, 0, 0)-Colorability of planar graphs without prescribed short cycles. 627-646 - Yong Xia, Wajeb Gharibi:
On improving convex quadratic programming relaxation for the quadratic assignment problem. 647-667 - Zofia Stepien, Lucjan Szymaszkiewicz, Maciej Zwierzchowski:
The Cartesian product of cycles with small 2-rainbow domination number. 668-674 - Hualong Li, Laihao Ding, Bingqiang Liu, Guanghui Wang:
Neighbor sum distinguishing total colorings of planar graphs. 675-688 - Pratik Worah:
Rank bounds for a hierarchy of Lovász and Schrijver. 689-709 - Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos:
A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm. 710-728 - Benjamin McClosky, John D. Arellano, Illya V. Hicks:
Co-2-plex vertex partitions. 729-746 - Thang N. Dinh, Nam P. Nguyen, Md Abdul Alim, My T. Thai:
A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks. 747-767 - Eranda Çela, Rostislav Stanek:
Heuristics for the data arrangement problem on regular trees. 768-802 - Byeong Moon Kim, Yoomi Rho, Byung Chul Song:
L(1, 1)-labelling of the direct product of a complete graph and a cycle. 803-811 - Yuejian Peng, Qingsong Tang, Cheng Zhao:
On Lagrangians of r-uniform hypergraphs. 812-825 - Hanyuan Deng, Guihua Huang, Xiaojuan Jiang:
A unified linear-programming modeling of some topological indices. 826-837
Volume 30, Number 4, November 2015
- Liwei Zhong, Guochun Tang:
Preface. 839-840 - Mengzhuo Bai, Chunyang Ren, Yang Liu:
A note of reduced dimension optimization algorithm of assignment problem. 841-849 - Yanqin Bai, Xiao Han, Tong Chen, Hua Yu:
Quadratic kernel-free least squares support vector machine for target diseases classification. 850-870 - Xi Chen, Zhi-Ping Fan, Zhiwu Li, Xueliang Han, Xiao Zhang, Haochen Jia:
A two-stage method for member selection of emergency medical service. 871-891 - Jing Fan, Xiwen Lu:
Supply chain scheduling problem in the hospital with periodic working time on a single machine. 892-905 - Beibei Li, Zhihong Zhao, Xuan Shen, Cendi Xue, Liwei Zhong:
Fitting α β-crystalline structure onto electron microscopy based on SO(3) rotation group theory. 906-919 - Jing Li, Ming Dong, Yijiong Ren, Kaiqi Yin:
How patient compliance impacts the recommendations for colorectal cancer screening. 920-937 - Lili Liu, Guochun Tang, Baoqiang Fan, Xingpeng Wang:
Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process. 938-948 - Bing Wang, Xingbao Han, Xianxia Zhang, Shaohua Zhang:
Predictive-reactive scheduling for single surgical suite subject to random emergency surgery. 949-966 - Dujuan Wang, Feng Liu, Yunqiang Yin, Jian-Jun Wang, Yanzhang Wang:
Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period. 967-981 - Shan Wang, Huiqiao Su, Guohua Wan:
Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling. 982-995 - Jihong Yan, Wenliang Cheng, Chengyu Wang, Jun Liu, Ming Gao, Aoying Zhou:
Optimizing word set coverage for multi-event summarization. 996-1015 - Ying Yang, Bing Shen, Wei Gao, Yong Liu, Liwei Zhong:
A surgical scheduling method considering surgeons' preferences. 1016-1026 - Xingong Zhang, Hui Wang, Xingpeng Wang:
Patients scheduling problems with deferred deteriorated functions. 1027-1041 - Fouad Kharroubi, Jing He, Jin Tang, Ming Chen, Lin Chen:
Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks. 1042-1061 - Yinfeng Xu, Huili Zhang:
How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis. 1062-1076 - B. S. Panda, D. Pushparaj Shetty:
Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks. 1077-1094 - Gerard Jennhwa Chang, Nicolas Roussel:
On the k-power domination of hypergraphs. 1095-1106 - Zengfu Wang, William Moran, Xuezhi Wang, Quan Pan:
An accelerated continuous greedy algorithm for maximizing strong submodular functions. 1107-1124 - Hanyuan Deng, B. Krishnakumari, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran:
Multiplicatively weighted Harary index of graphs. 1125-1137 - Madalina M. Drugan:
Generating QAP instances with known optimum solution and additively decomposable cost function. 1138-1172 - Yingfan L. Du, Hongmin W. Du:
A new bound on maximum independent set and minimum connected dominating set in unit disk graphs. 1173-1179 - Yuehua Bu, Xiaoyan Yan:
List 2-distance coloring of planar graphs. 1180-1195 - Easton Li Xu, Guangyue Han:
The minimum number of hubs in networks. 1196-1218 - Hai Du, Yinfeng Xu, Binhai Zhu:
An incremental version of the k-center problem on boundary of a convex polygon. 1219-1227
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.