

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. 279302
 Radoslav Fulek and Csaba D. Tóth
 A class of exponential neighbourhoods for the quadratic travelling salesman problem pp. 303332
 Brad D. Woods and Abraham P. Punnen
 Coordination mechanisms for scheduling selfish jobs with favorite machines pp. 333365
 Cong Chen and Yinfeng Xu
 Approximation algorithms for the selling with preference pp. 366378
 Pan Li, Qiang Hua, Zhijun Hu, HingFung Ting and Yong Zhang
 Searching and inferring colorful topological motifs in vertexcolored graphs pp. 379411
 Diego P. Rubert, Eloi Araujo, Marco A. Stefanes, Jens Stoye and Fábio V. Martinez
 More on limited packings in graphs pp. 412430
 Xuqing Bai, Hong Chang and Xueliang Li
 Integer linear programming formulations of the filter partitioning minimization problem pp. 431453
 Hazhar Rahmani and Jason M. O’Kane
 The band collocation problem pp. 454481
 Hakan Kutucu, Arif Gursoy, Mehmet Kurt and Urfat Nuriyev
 Power domination on triangular grids with triangular and hexagonal shape pp. 482500
 Prosenjit Bose, Valentin Gledel, Claire Pennarun and Sander Verdonschot
 On the Roman domination subdivision number of a graph pp. 501511
 J. Amjadi, R. Khoeilar, M. Chellali and Z. Shao
 On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering pp. 512546
 Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab AlQurashi and Anastasios Sidiropoulos
 Multiprocessor open shop problem: literature review and future directions pp. 547569
 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 10colorable pp. 120
 Jiangxu Kong, Xiaoxue Hu and Yiqiao Wang
 Approximating the asymmetric pcenter problem in parameterized complete digraphs pp. 2135
 Wei Ding and Ke Qiu
 A variation of DS decomposition in set function optimization pp. 3644
 Xiang Li, H. George Du and Panos M. Pardalos
 Planar graphs without 4 and 6cycles are (7: 2)colorable pp. 4558
 Haitao Wu, Yaojun Chen and Xiaolan Hu
 Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number pp. 5968
 Yan Liu, Mengxia Lei and Xueli Su
 A $$\frac{5}{2}$$52approximation algorithm for coloring rooted subtrees of a degree 3 tree pp. 6997
 Anuj Rawat and Mark Shayman
 Secure domination of honeycomb networks pp. 98109
 M. R. Chithra and Manju K. Menon
 Joint chance constrained shortest path problem with Copula theory pp. 110140
 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. 141169
 Thi Thanh Sang Nguyen and Pham Minh Thu Do
 An improved semionline algorithm for scheduling on a single machine with unexpected breakdown pp. 170180
 Ji Tian, Yan Zhou and Ruyan Fu
 New restrictions on defective coloring with applications to steinbergtype graphs pp. 181204
 Addie Armstrong and Nancy Eaton
 KATZ centrality with biogeographybased optimization for influence maximization problem pp. 205226
 Abbas Salehi and Behrooz Masoumi
 The strong chromatic index of graphs with edge weight eight pp. 227233
 Lily Chen, Shumei Chen, Ren Zhao and Xiangqian Zhou
 Analysis of DivideandConquer strategies for the 0–1 minimization knapsack problem pp. 234278
 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. 933954
 Yi Chu, Boxiao Liu, Shaowei Cai, Chuan Luo and Haihang You
 Codensity and fractional edge cover packing pp. 955987
 Qiulan Zhao, Zhibin Chen and Jiajun Sang
 On the robustness of a synchronized multirobot system pp. 9881016
 Sergey Bereg, Andrew Brunner, LuisEvaristo Caraballo, JoséMiguel DíazBáñez and Mario A. Lopez
 Maximum independent and disjoint coverage pp. 10171037
 Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit and Jagpreet Singh
 Neighbourdistinguishing labellings of powers of paths and powers of cycles pp. 10381059
 Atílio G. Luiz, C. N. Campos, Simone Dantas and Diana Sasaki
 Twomachine flow shop scheduling with an operator nonavailability period to minimize makespan pp. 10601078
 Dawei Li and Xiwen Lu
 Stabilizing social structure via modifying local patterns pp. 10791095
 Sajjad Salehi and Fattaneh Taghiyareh
 The quadratic cycle cover problem: special cases and efficient bounds pp. 10961128
 Frank Meijer and Renata Sotirov
 Local antimagic orientation of graphs pp. 11291152
 Yulin Chang, Fei Jing and Guanghui Wang
 Efficient reassembling of threeregular planar graphs pp. 11531207
 Assaf Kfoury and Benjamin Sisson
 A 1/2approximation algorithm for maximizing a nonmonotone weaksubmodular function on a bounded integer lattice pp. 12081220
 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. 637661
 Qiulan Zhao and Jinjiang Yuan
 The complexity of symmetric connectivity in directional wireless sensor networks pp. 662686
 Tien Tran and Dung T. Huynh
 Compact quadratizations for pseudoBoolean functions pp. 687707
 Endre Boros, Yves Crama and Elisabeth RodríguezHeck
 Dynamic programming algorithms for the general quay crane doublecycling problem with internalreshuffles pp. 708724
 Feifeng Zheng, Yaxin Pang, Ming Liu and Yinfeng Xu
 A primaldual algorithm for the minimum partial set multicover problem pp. 725746
 Yingli Ran, Yishuo Shi, Changbing Tang and Zhao Zhang
 Algorithmic and complexity aspects of problems related to total Roman domination for graphs pp. 747763
 Abolfazl Poureidi and Nader Jafari Rad
 Exponential time algorithms for justintime scheduling problems with common due date and symmetric weights pp. 764775
 Vincent T’kindt, Lei Shang and Federico Della Croce
 On reduced second Zagreb index pp. 776791
 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. 792825
 Rupaj Kumar Nayak and Nirmalya Kumar Mohanty
 Linear time algorithms for finding independent spanning trees on pyramid networks pp. 826848
 ShuoI Wang and FuHsing Wang
 Marginal contributions and derivatives for set functions in cooperative games pp. 849858
 Daniel Li Li and Erfang Shan
 On the sizes of bikmaximal graphs pp. 859873
 Liqiong Xu, Yingzhi Tian and HongJian Lai
 Contrast in greyscales of graphs pp. 874898
 Natalia Castro, María A. GarridoVizuete, Rafael Robles and María Trinidad VillarLiñán
 3D camera sensor scheduling algorithms for indoor multiobjective tracking pp. 899914
 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. 915932
 Ruizhi Lin and Heping Zhang
2020, volume 39, issue 2
 Price of dependence: stochastic submodular maximization with dependent items pp. 305314
 Shaojie Tang
 The average covering tree value for directed graph games pp. 315333
 Anna Khmelnitskaya, Özer Selçuk and Dolf Talman
 On the edge metric dimension of convex polytopes and its related graphs pp. 334350
 Yuezhong Zhang and Suogang Gao
 The Wiener index of hypergraphs pp. 351364
 Xiangxiang Liu, Ligong Wang and Xihe Li
 On the zero forcing number of a graph involving some classical parameters pp. 365384
 Shuchao Li and Wanting Sun
 A new approximate cluster deletion algorithm for diamondfree graphs pp. 385411
 Sabrine Malek and Wady Naanaa
 On the total neighbour sum distinguishing index of graphs with bounded maximum average degree pp. 412424
 H. Hocquard and J. Przybyło
 Domination and matching in power and generalized power hypergraphs pp. 425436
 Yanxia Dong, Moo Young Sohn and Zuosong Liang
 Nontrivial path covers of graphs: existence, minimization and maximization pp. 437456
 Renzo Gómez and Yoshiko Wakabayashi
 Degree bounded bottleneck spanning trees in three dimensions pp. 457491
 Patrick J. Andersen and Charl J. Ras
 Approximation algorithms for solving the 1line Euclidean minimum Steiner tree problem pp. 492508
 Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang and Yujie Zheng
 A new upper bound on the work function algorithm for the kserver problem pp. 509518
 Wenming Zhang and Yongxi Cheng
 Research on the impact of green innovation alliance mode on decisionmaking of twocycle closedloop supply chain pp. 519546
 Chunmei Ma and Dan Huang
 A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm pp. 547580
 Wenjuan Fan, Yi Wang, Tongzhu Liu and Guixian Tong
 Equitable partition of graphs into induced linear forests pp. 581588
 Xin Zhang and Bei Niu
 On alternating paths and the smallest positive eigenvalue of trees pp. 589601
 Sonu Rani and Sasmita Barik
 A new leader guided optimization for the flexible job shop problem pp. 602617
 Fraj Naifar, Mariem Gzara and Moalla Taicir Loukil
 Local search strikes again: PTAS for variants of geometric covering and packing pp. 618635
 Pradeesha Ashok, Aniket Basu Roy and Sathish Govindarajan
2020, volume 39, issue 1
 Approximation algorithms for twostage flexible flow shop scheduling pp. 114
 Minghui Zhang, Yan Lan and Xin Han
 The seeding algorithm for kmeans problem with penalties pp. 1532
 Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang and Peng Zhang
 Less is more approach for competing groups scheduling with different learning effects pp. 3354
 Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang and Panos M. Pardalos
 Graphs with equal domination and covering numbers pp. 5571
 Andrzej Lingas, Mateusz Miotk, Jerzy Topp and Paweł Żyliński
 Neighbor product distinguishing total colorings of 2degenerate graphs pp. 7276
 Enqiang Zhu, Chanjuan Liu and Jiguo Yu
 Bounds on upper transversals in hypergraphs pp. 7789
 Michael A. Henning and Anders Yeo
 Algorithmic results on double Roman domination in graphs pp. 90114
 S. Banerjee, Michael A. Henning and D. Pradhan
 On the extremal graphs with respect to the total reciprocal edgeeccentricity pp. 115137
 Lifang Zhao, Hongshuai Li and Yuping Gao
 Approximation algorithm for a generalized Roman domination problem in unit ball graphs pp. 138148
 Limin Wang, Yalin Shi, Zhao Zhang, ZanBo Zhang and Xiaoyan Zhang
 Remarks on Barnette’s conjecture pp. 149155
 Jan Florek
 Treecoloring problems of bounded treewidth graphs pp. 156169
 Bi Li and Xin Zhang
 The structure of graphs with given number of blocks and the maximum Wiener index pp. 170184
 Stéphane Bessy, François Dross, Katarína Hriňáková, Martin Knor and Riste Škrekovski
 Dynamic threestage operating room scheduling considering patient waiting time and surgical overtime costs pp. 185215
 Shuwan Zhu, Wenjuan Fan, Tongzhu Liu, Shanlin Yang and Panos M. Pardalos
 Efficient algorithms for measuring the funnellikeness of DAGs pp. 216245
 Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier and Manuel Sorge
 Neighbordistinguishing total coloring of planar graphs with maximum degree twelve pp. 246272
 Jingjing Huo, Yiqiao Wang, Weifan Wang and Wenjing Xia
 On the König deficiency of zeroreducible graphs pp. 273292
 Miklós Bartha and Miklós Krész
 Neighbor sum distinguishing total colorings of ICplanar graphs with maximum degree 13 pp. 293303
 Chao Song and Changqing Xu

On this page 2020, volume 40

Issue 2
Issue 1
 2020, volume 39

Issue 4
Issue 3 Issue 2 Issue 1
Other years 2019, volume 38
2019, volume 37
2018, volume 36
2018, volume 35
2017, volume 34
2017, volume 33
2016, volume 32
2016, volume 31
2015, volume 30
2015, volume 29
2014, volume 28
2014, volume 27
2013, volume 26
2013, volume 25
2012, volume 24
2012, volume 23
2011, volume 22
2011, volume 21
2010, volume 20
2010, volume 19
2009, volume 18
2009, volume 17
2008, volume 16
2008, volume 15
2007, volume 14
2007, volume 13
2006, volume 12
2006, volume 11
2005, volume 10
2005, volume 9
2004, volume 8
2003, volume 7
2002, volume 6
2001, volume 5
2000, volume 4
1999, volume 3
1998, volume 2
1998, volume 1
1997, volume 1
Undated

On this page 2020, volume 40

Issue 2
Issue 1
 2020, volume 39

Issue 4
Issue 3 Issue 2 Issue 1
Other years 2019, volume 38
2019, volume 37
2018, volume 36
2018, volume 35
2017, volume 34
2017, volume 33
2016, volume 32
2016, volume 31
2015, volume 30
2015, volume 29
2014, volume 28
2014, volume 27
2013, volume 26
2013, volume 25
2012, volume 24
2012, volume 23
2011, volume 22
2011, volume 21
2010, volume 20
2010, volume 19
2009, volume 18
2009, volume 17
2008, volume 16
2008, volume 15
2007, volume 14
2007, volume 13
2006, volume 12
2006, volume 11
2005, volume 10
2005, volume 9
2004, volume 8
2003, volume 7
2002, volume 6
2001, volume 5
2000, volume 4
1999, volume 3
1998, volume 2
1998, volume 1
1997, volume 1
Undated

