EconPapers    
Economics at your fingertips  
 

Journal of Combinatorial Optimization

1997 - 2020

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla ().

Access Statistics for this journal.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.


2020, volume 40, issue 2

Crossing minimization in perturbed drawings pp. 279-302 Downloads
Radoslav Fulek and Csaba D. Tóth
A class of exponential neighbourhoods for the quadratic travelling salesman problem pp. 303-332 Downloads
Brad D. Woods and Abraham P. Punnen
Coordination mechanisms for scheduling selfish jobs with favorite machines pp. 333-365 Downloads
Cong Chen and Yinfeng Xu
Approximation algorithms for the selling with preference pp. 366-378 Downloads
Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting and Yong Zhang
Searching and inferring colorful topological motifs in vertex-colored graphs pp. 379-411 Downloads
Diego P. Rubert, Eloi Araujo, Marco A. Stefanes, Jens Stoye and Fábio V. Martinez
More on limited packings in graphs pp. 412-430 Downloads
Xuqing Bai, Hong Chang and Xueliang Li
Integer linear programming formulations of the filter partitioning minimization problem pp. 431-453 Downloads
Hazhar Rahmani and Jason M. O’Kane
The band collocation problem pp. 454-481 Downloads
Hakan Kutucu, Arif Gursoy, Mehmet Kurt and Urfat Nuriyev
Power domination on triangular grids with triangular and hexagonal shape pp. 482-500 Downloads
Prosenjit Bose, Valentin Gledel, Claire Pennarun and Sander Verdonschot
On the Roman domination subdivision number of a graph pp. 501-511 Downloads
J. Amjadi, R. Khoeilar, M. Chellali and Z. Shao
On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering pp. 512-546 Downloads
Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi and Anastasios Sidiropoulos
Multiprocessor open shop problem: literature review and future directions pp. 547-569 Downloads
Zeynep Adak, Mahmure Övül Arıoğlu Akan and Serol Bulkan

2020, volume 40, issue 1

Plane graphs with $$\Delta =7$$Δ=7 are entirely 10-colorable pp. 1-20 Downloads
Jiangxu Kong, Xiaoxue Hu and Yiqiao Wang
Approximating the asymmetric p-center problem in parameterized complete digraphs pp. 21-35 Downloads
Wei Ding and Ke Qiu
A variation of DS decomposition in set function optimization pp. 36-44 Downloads
Xiang Li, H. George Du and Panos M. Pardalos
Planar graphs without 4- and 6-cycles are (7: 2)-colorable pp. 45-58 Downloads
Haitao Wu, Yaojun Chen and Xiaolan Hu
Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number pp. 59-68 Downloads
Yan Liu, Mengxia Lei and Xueli Su
A $$\frac{5}{2}$$52-approximation algorithm for coloring rooted subtrees of a degree 3 tree pp. 69-97 Downloads
Anuj Rawat and Mark Shayman
Secure domination of honeycomb networks pp. 98-109 Downloads
M. R. Chithra and Manju K. Menon
Joint chance constrained shortest path problem with Copula theory pp. 110-140 Downloads
Zohreh Hosseini Nodeh, Ali Babapour Azar, Rashed Khanjani Shiraz, Salman Khodayifar and Panos M. Pardalos
Classification optimization for training a large dataset with Naïve Bayes pp. 141-169 Downloads
Thi Thanh Sang Nguyen and Pham Minh Thu Do
An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown pp. 170-180 Downloads
Ji Tian, Yan Zhou and Ruyan Fu
New restrictions on defective coloring with applications to steinberg-type graphs pp. 181-204 Downloads
Addie Armstrong and Nancy Eaton
KATZ centrality with biogeography-based optimization for influence maximization problem pp. 205-226 Downloads
Abbas Salehi and Behrooz Masoumi
The strong chromatic index of graphs with edge weight eight pp. 227-233 Downloads
Lily Chen, Shumei Chen, Ren Zhao and Xiangqian Zhou
Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem pp. 234-278 Downloads
Fernando A. Morales and Jairo A. Martínez

2020, volume 39, issue 4

An efficient local search algorithm for solving maximum edge weight clique problem in large graphs pp. 933-954 Downloads
Yi Chu, Boxiao Liu, Shaowei Cai, Chuan Luo and Haihang You
Co-density and fractional edge cover packing pp. 955-987 Downloads
Qiulan Zhao, Zhibin Chen and Jiajun Sang
On the robustness of a synchronized multi-robot system pp. 988-1016 Downloads
Sergey Bereg, Andrew Brunner, Luis-Evaristo Caraballo, José-Miguel Díaz-Báñez and Mario A. Lopez
Maximum independent and disjoint coverage pp. 1017-1037 Downloads
Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit and Jagpreet Singh
Neighbour-distinguishing labellings of powers of paths and powers of cycles pp. 1038-1059 Downloads
Atílio G. Luiz, C. N. Campos, Simone Dantas and Diana Sasaki
Two-machine flow shop scheduling with an operator non-availability period to minimize makespan pp. 1060-1078 Downloads
Dawei Li and Xiwen Lu
Stabilizing social structure via modifying local patterns pp. 1079-1095 Downloads
Sajjad Salehi and Fattaneh Taghiyareh
The quadratic cycle cover problem: special cases and efficient bounds pp. 1096-1128 Downloads
Frank Meijer and Renata Sotirov
Local antimagic orientation of graphs pp. 1129-1152 Downloads
Yulin Chang, Fei Jing and Guanghui Wang
Efficient reassembling of three-regular planar graphs pp. 1153-1207 Downloads
Assaf Kfoury and Benjamin Sisson
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice pp. 1208-1220 Downloads
Qingqin Nong, Jiazhu Fang, Suning Gong, Dingzhu Du, Yan Feng and Xiaoying Qu

2020, volume 39, issue 3

Bicriteria scheduling of equal length jobs on uniform parallel machines pp. 637-661 Downloads
Qiulan Zhao and Jinjiang Yuan
The complexity of symmetric connectivity in directional wireless sensor networks pp. 662-686 Downloads
Tien Tran and Dung T. Huynh
Compact quadratizations for pseudo-Boolean functions pp. 687-707 Downloads
Endre Boros, Yves Crama and Elisabeth Rodríguez-Heck
Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles pp. 708-724 Downloads
Feifeng Zheng, Yaxin Pang, Ming Liu and Yinfeng Xu
A primal-dual algorithm for the minimum partial set multi-cover problem pp. 725-746 Downloads
Yingli Ran, Yishuo Shi, Changbing Tang and Zhao Zhang
Algorithmic and complexity aspects of problems related to total Roman domination for graphs pp. 747-763 Downloads
Abolfazl Poureidi and Nader Jafari Rad
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights pp. 764-775 Downloads
Vincent T’kindt, Lei Shang and Federico Della Croce
On reduced second Zagreb index pp. 776-791 Downloads
Lkhagva Buyantogtokh, Batmend Horoldagva and Kinkar Chandra Das
Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation pp. 792-825 Downloads
Rupaj Kumar Nayak and Nirmalya Kumar Mohanty
Linear time algorithms for finding independent spanning trees on pyramid networks pp. 826-848 Downloads
Shuo-I Wang and Fu-Hsing Wang
Marginal contributions and derivatives for set functions in cooperative games pp. 849-858 Downloads
Daniel Li Li and Erfang Shan
On the sizes of bi-k-maximal graphs pp. 859-873 Downloads
Liqiong Xu, Yingzhi Tian and Hong-Jian Lai
Contrast in greyscales of graphs pp. 874-898 Downloads
Natalia Castro, María A. Garrido-Vizuete, Rafael Robles and María Trinidad Villar-Liñán
3D camera sensor scheduling algorithms for indoor multi-objective tracking pp. 899-914 Downloads
Yi Hong, Yongcai Wang, Yuqing Zhu, Deying Li, Zhibo Chen and Jing Li
Fractional matching preclusion number of graphs and the perfect matching polytope pp. 915-932 Downloads
Ruizhi Lin and Heping Zhang

2020, volume 39, issue 2

Price of dependence: stochastic submodular maximization with dependent items pp. 305-314 Downloads
Shaojie Tang
The average covering tree value for directed graph games pp. 315-333 Downloads
Anna Khmelnitskaya, Özer Selçuk and Dolf Talman
On the edge metric dimension of convex polytopes and its related graphs pp. 334-350 Downloads
Yuezhong Zhang and Suogang Gao
The Wiener index of hypergraphs pp. 351-364 Downloads
Xiangxiang Liu, Ligong Wang and Xihe Li
On the zero forcing number of a graph involving some classical parameters pp. 365-384 Downloads
Shuchao Li and Wanting Sun
A new approximate cluster deletion algorithm for diamond-free graphs pp. 385-411 Downloads
Sabrine Malek and Wady Naanaa
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree pp. 412-424 Downloads
H. Hocquard and J. Przybyło
Domination and matching in power and generalized power hypergraphs pp. 425-436 Downloads
Yanxia Dong, Moo Young Sohn and Zuosong Liang
Nontrivial path covers of graphs: existence, minimization and maximization pp. 437-456 Downloads
Renzo Gómez and Yoshiko Wakabayashi
Degree bounded bottleneck spanning trees in three dimensions pp. 457-491 Downloads
Patrick J. Andersen and Charl J. Ras
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem pp. 492-508 Downloads
Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang and Yujie Zheng
A new upper bound on the work function algorithm for the k-server problem pp. 509-518 Downloads
Wenming Zhang and Yongxi Cheng
Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain pp. 519-546 Downloads
Chunmei Ma and Dan Huang
A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm pp. 547-580 Downloads
Wenjuan Fan, Yi Wang, Tongzhu Liu and Guixian Tong
Equitable partition of graphs into induced linear forests pp. 581-588 Downloads
Xin Zhang and Bei Niu
On alternating paths and the smallest positive eigenvalue of trees pp. 589-601 Downloads
Sonu Rani and Sasmita Barik
A new leader guided optimization for the flexible job shop problem pp. 602-617 Downloads
Fraj Naifar, Mariem Gzara and Moalla Taicir Loukil
Local search strikes again: PTAS for variants of geometric covering and packing pp. 618-635 Downloads
Pradeesha Ashok, Aniket Basu Roy and Sathish Govindarajan

2020, volume 39, issue 1

Approximation algorithms for two-stage flexible flow shop scheduling pp. 1-14 Downloads
Minghui Zhang, Yan Lan and Xin Han
The seeding algorithm for k-means problem with penalties pp. 15-32 Downloads
Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang and Peng Zhang
Less is more approach for competing groups scheduling with different learning effects pp. 33-54 Downloads
Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang and Panos M. Pardalos
Graphs with equal domination and covering numbers pp. 55-71 Downloads
Andrzej Lingas, Mateusz Miotk, Jerzy Topp and Paweł Żyliński
Neighbor product distinguishing total colorings of 2-degenerate graphs pp. 72-76 Downloads
Enqiang Zhu, Chanjuan Liu and Jiguo Yu
Bounds on upper transversals in hypergraphs pp. 77-89 Downloads
Michael A. Henning and Anders Yeo
Algorithmic results on double Roman domination in graphs pp. 90-114 Downloads
S. Banerjee, Michael A. Henning and D. Pradhan
On the extremal graphs with respect to the total reciprocal edge-eccentricity pp. 115-137 Downloads
Lifang Zhao, Hongshuai Li and Yuping Gao
Approximation algorithm for a generalized Roman domination problem in unit ball graphs pp. 138-148 Downloads
Limin Wang, Yalin Shi, Zhao Zhang, Zan-Bo Zhang and Xiaoyan Zhang
Remarks on Barnette’s conjecture pp. 149-155 Downloads
Jan Florek
Tree-coloring problems of bounded treewidth graphs pp. 156-169 Downloads
Bi Li and Xin Zhang
The structure of graphs with given number of blocks and the maximum Wiener index pp. 170-184 Downloads
Stéphane Bessy, François Dross, Katarína Hriňáková, Martin Knor and Riste Škrekovski
Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs pp. 185-215 Downloads
Shuwan Zhu, Wenjuan Fan, Tongzhu Liu, Shanlin Yang and Panos M. Pardalos
Efficient algorithms for measuring the funnel-likeness of DAGs pp. 216-245 Downloads
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier and Manuel Sorge
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve pp. 246-272 Downloads
Jingjing Huo, Yiqiao Wang, Weifan Wang and Wenjing Xia
On the König deficiency of zero-reducible graphs pp. 273-292 Downloads
Miklós Bartha and Miklós Krész
Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 pp. 293-303 Downloads
Chao Song and Changqing Xu
Page updated 2020-07-11