default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 28
Volume 28, Number 1, July 2014
- Sergiy Butenko, Ding-Zhu Du, Mauricio G. C. Resende:
Preface. 1-2 - Thang N. Dinh
, My T. Thai, Hien T. Nguyen:
Bound and exact methods for assessing link vulnerability in complex networks. 3-24 - Theodoros P. Gevezes, Leonidas S. Pitsoulis:
Recognition of overlap graphs. 25-37 - Michael J. Hirsch, Daniel E. Schroeder, Alvaro Maggiar, Irina S. Dolinskaya:
Multi-depot vessel routing problem in a direction dependent wavefield. 38-57 - Gary A. Kochenberger, Jin-Kao Hao, Fred W. Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, Yang Wang:
The unconstrained binary quadratic programming problem: a survey. 58-81 - Leo Liberti, Fabrizio Marinelli:
Mathematical programming: Turing completeness and applications to software analysis. 82-104 - Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao:
An exact algorithm for the maximum probabilistic clique problem. 105-120 - David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson:
Characteristics of the maximal independent set ZDD. 121-139 - Luís A. C. Roque, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A hybrid biased random key genetic algorithm approach for the unit commitment problem. 140-166 - Maciej Rysz, Mohammad Mirghorbani, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
On risk-averse maximum weighted subgraph problems. 167-185 - Yilin Shen, Thang N. Dinh, My T. Thai, Hien T. Nguyen:
Staying safe and visible via message sharing in online social networks. 186-217 - Peter Tsyurmasto, Michael Zabarankin, Stan Uryasev:
Value-at-risk support vector machine: stability to outliers. 218-232 - Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
An integer programming framework for critical elements detection in graphs. 233-273 - Huijuan Wang, Lidong Wu, Weili Wu, Jianliang Wu:
Minimum number of disjoint linear forests covering a planar graph. 274-287 - Tao Zhang, W. Art Chaovalitwongse, Yuejie Zhang:
Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. 288-309 - Jiao Zhou, Zhao Zhang, Weili Wu, Kai Xing:
A greedy algorithm for the fault-tolerant connected dominating set in a general graph. 310-319
Volume 28, Number 2, August 2014
- Zemin Jin, Peipei Zhu:
Heterochromatic tree partition number in complete multipartite graphs. 321-340 - Martin Kochol:
Linear algebraic approach to an edge-coloring result. 341-347 - Jakub Przybylo:
On colour-blind distinguishing colour pallets in regular graphs. 348-357 - Amitai Armon, Iftah Gamzu, Danny Segev:
Mobile facility location: combinatorial filtering via weighted occupancy. 358-375 - Alain Billionnet, Sourour Elloumi, Amélie Lambert:
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. 376-399 - Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw, Jing-Ho Yan:
F3-domination problem of graphs. 400-413 - Seyed Farid Ghannadpour, Siamak Noori, Reza Tavakkoli-Moghaddam:
A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority. 414-446 - Gasper Kosmrlj:
Realizations of the game domination number. 447-461 - Vadim V. Lozin, Christopher Purcell:
Coloring vertices of claw-free graphs in three colors. 462-479 - Yuya Higashikawa, Naoki Katoh, Stefan Langerman, Shin-ichi Tanigawa:
Online graph exploration algorithms for cycles and trees by multiple searchers. 480-495 - Shuxin Cai, Wenguo Yang, Yaohua Tang:
Approximating soft-capacitated facility location problem with uncertainty. 496-504 - Hsiang-Chun Hsu, Gerard Jennhwa Chang:
Graphs with small balanced decomposition numbers. 505-510
Volume 28, Number 3, October 2014
- My T. Thai, Thang N. Dinh:
Preface. 511-512 - Yuanjun Bi, Weili Wu, Yuqing Zhu, Lidan Fan, Ailian Wang:
A nature-inspired influence propagation model for the community expansion problem. 513-528 - Lidan Fan, Zaixin Lu, Weili Wu, Yuanjun Bi, Ailian Wang, Bhavani Thuraisingham:
An individual-based model of information diffusion combining friends' influence. 529-539 - Danica Vukadinovic Greetham, Zhivko Stoyanov, Peter Grindrod:
On the radius of centrality in evolving communication networks. 540-560 - Meng Han, Mingyuan Yan, Jinbao Li, Shouling Ji, Yingshu Li:
Neighborhood-based uncertainty generation in social networks. 561-576 - Donghyun Kim, Deying Li, Omid Asgari, Yingshu Li, Alade O. Tokuta, Heekuck Oh:
Computing an effective decision making group of a society using social network analysis. 577-587 - Yan Qiang, Bo Pei, Weili Wu, Juanjuan Zhao, Xiaolong Zhang, Yue Li, Lidong Wu:
Improvement of path analysis algorithm in social networks based on HBase. 588-599 - Li Wang, Jiang Wang, Yuanjun Bi, Weili Wu, Wen Xu, Biao Lian:
Noise-tolerance community detection and evolution in dynamic social networks. 600-612 - Juanjuan Zhao, Weili Wu, Xiaolong Zhang, Yan Qiang, Tao Liu, Lidong Wu:
A short-term trend prediction model of topic over Sina Weibo dataset. 613-625 - Haiying Zhou, Wai Chee Shiu, Peter Che Bor Lam:
Notes on L(1, 1) and L(2, 1) labelings for n-cube. 626-638 - Takehiro Ito, Erik D. Demaine:
Approximability of the subset sum reconfiguration problem. 639-654 - Guiwu Xiong, Yong Wang:
Best routes selection in multimodal networks using multi-objective genetic algorithm. 655-673 - Federico Della Croce, Vangelis Th. Paschos:
Efficient algorithms for the max k-vertex cover problem. 674-691 - Yiqiao Wang, Qiaojun Shu, Jian-Liang Wu, Wenwen Zhang:
Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle. 692-715
Volume 28, Number 4, November 2014
- Yusheng Li, Qizhong Lin:
Lower bounds for independence numbers of some locally sparse graphs. 717-725 - Asaf Levin, Uri Yovel:
Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees. 726-747 - Zofia Stepien, Maciej Zwierzchowski:
2-Rainbow domination number of Cartesian products: $$C_{n}\square C_{3}$$ and $$C_{n}\square C_{5}$$. 748-755 - Qiang Zhang, Minming Li:
Strategyproof mechanism design for facility location games with weighted agents on a line. 756-773 - Lingji Xu, Zhengke Miao, Yingqian Wang:
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. 774-786 - Dengju Ma, Hengfeng Zhu, Jianbao He:
$$\lambda $$ -numbers of several classes of snarks. 787-799 - Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng:
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion. 800-813 - Michael Hallaway, Cong X. Kang, Eunjeong Yi:
On metric dimension of permutation graphs. 814-826 - Kan Yu, Mei Lu:
2-Distance paired-dominating number of graphs. 827-836 - Wei Ding, Ke Qiu:
Algorithms for the minimum diameter terminal Steiner tree problem. 837-853 - Liangyu Chen, Zhenbing Zeng, Wei Zhou:
An upper bound of Heilbronn number for eight points in triangles. 854-874 - Leah Epstein, Hanan Zebedat-Haider:
Online scheduling with rejection and reordering: exact algorithms for unit size jobs. 875-892 - Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang:
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. 893-909 - Chenxia Zhao, Xianyue Li:
Approximation algorithms on 0-1 linear knapsack problem with a single continuous variable. 910-916
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.
last updated on 2024-11-08 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
