Dong, Qingzhen; Li, Xianyue; Yang, Yu Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance. (English) Zbl 07792560 J. Comb. Optim. 46, No. 4, Paper No. 27, 18 p. (2023). MSC: 90Cxx PDFBibTeX XMLCite \textit{Q. Dong} et al., J. Comb. Optim. 46, No. 4, Paper No. 27, 18 p. (2023; Zbl 07792560) Full Text: DOI
He, Ze-Hua Combinatorial optimization analysis of the production process of C4 olefins from ethanol based on the PSO-BP algorithm. (English) Zbl 07721478 J. Comb. Optim. 45, No. 5, Paper No. 136, 37 p. (2023). MSC: 90C27 90C59 90C90 PDFBibTeX XMLCite \textit{Z.-H. He}, J. Comb. Optim. 45, No. 5, Paper No. 136, 37 p. (2023; Zbl 07721478) Full Text: DOI
Li, Peng; Wang, Aifa Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs. (English) Zbl 1510.90238 J. Comb. Optim. 45, No. 1, Paper No. 45, 16 p. (2023). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{P. Li} and \textit{A. Wang}, J. Comb. Optim. 45, No. 1, Paper No. 45, 16 p. (2023; Zbl 1510.90238) Full Text: DOI
Ji, Sai; Dong, Yinhong; Du, Donglei; Wang, Dongzhao; Xu, Dachuan Approximation algorithms for the lower bounded correlation clustering problem. (English) Zbl 1509.90169 J. Comb. Optim. 45, No. 1, Paper No. 43, 19 p. (2023). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{S. Ji} et al., J. Comb. Optim. 45, No. 1, Paper No. 43, 19 p. (2023; Zbl 1509.90169) Full Text: DOI
Li, Xianyue; Yang, Ruowang; Zhang, Heping; Zhang, Zhao Partial inverse maximum spanning tree problem under the Chebyshev norm. (English) Zbl 1505.90108 J. Comb. Optim. 44, No. 5, 3331-3350 (2022). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{X. Li} et al., J. Comb. Optim. 44, No. 5, 3331--3350 (2022; Zbl 1505.90108) Full Text: DOI
Nip, Kameng; Shi, Tianning; Wang, Zhenbo Some graph optimization problems with weights satisfying linear constraints. (English) Zbl 1485.90144 J. Comb. Optim. 43, No. 1, 200-225 (2022). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{K. Nip} et al., J. Comb. Optim. 43, No. 1, 200--225 (2022; Zbl 1485.90144) Full Text: DOI
Cohen, Johanne; Italiano, Giuseppe F.; Manoussakis, Yannis; Thang, Nguyen Kim; Pham, Hong Phong Tropical paths in vertex-colored graphs. (English) Zbl 1481.90273 J. Comb. Optim. 42, No. 3, 476-498 (2021). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{J. Cohen} et al., J. Comb. Optim. 42, No. 3, 476--498 (2021; Zbl 1481.90273) Full Text: DOI
Malek, Sabrine; Naanaa, Wady A new approximate cluster deletion algorithm for diamond-free graphs. (English) Zbl 1434.90172 J. Comb. Optim. 39, No. 2, 385-411 (2020). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{S. Malek} and \textit{W. Naanaa}, J. Comb. Optim. 39, No. 2, 385--411 (2020; Zbl 1434.90172) Full Text: DOI
Banerjee, Sumanta; Henning, Michael A.; Pradhan, D. Algorithmic results on double Roman domination in graphs. (English) Zbl 1434.05105 J. Comb. Optim. 39, No. 1, 90-114 (2020). MSC: 05C69 90C35 05C35 68Q17 PDFBibTeX XMLCite \textit{S. Banerjee} et al., J. Comb. Optim. 39, No. 1, 90--114 (2020; Zbl 1434.05105) Full Text: DOI
Nip, Kameng; Wang, Zhenbo On the approximability of the two-phase knapsack problem. (English) Zbl 1433.90142 J. Comb. Optim. 38, No. 4, 1155-1179 (2019). MSC: 90C27 90C10 90C59 PDFBibTeX XMLCite \textit{K. Nip} and \textit{Z. Wang}, J. Comb. Optim. 38, No. 4, 1155--1179 (2019; Zbl 1433.90142) Full Text: DOI
Gao, Yuan; Yuan, Jinjiang Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs. (English) Zbl 1427.90140 J. Comb. Optim. 38, No. 3, 698-711 (2019). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{Y. Gao} and \textit{J. Yuan}, J. Comb. Optim. 38, No. 3, 698--711 (2019; Zbl 1427.90140) Full Text: DOI
Ghiyasvand, Mehdi An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem. (English) Zbl 1426.90245 J. Comb. Optim. 37, No. 3, 957-969 (2019). MSC: 90C35 PDFBibTeX XMLCite \textit{M. Ghiyasvand}, J. Comb. Optim. 37, No. 3, 957--969 (2019; Zbl 1426.90245) Full Text: DOI
Fujita, Shinya; Jensen, Tommy; Park, Boram; Sakuma, Tadashi On the weighted safe set problem on paths and cycles. (English) Zbl 1423.90261 J. Comb. Optim. 37, No. 2, 685-701 (2019). MSC: 90C35 PDFBibTeX XMLCite \textit{S. Fujita} et al., J. Comb. Optim. 37, No. 2, 685--701 (2019; Zbl 1423.90261) Full Text: DOI arXiv Link
Dong, Jianming; Jin, Ruyan; Hu, Jueliang; Lin, Guohui A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. (English) Zbl 1423.90089 J. Comb. Optim. 37, No. 2, 668-684 (2019). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{J. Dong} et al., J. Comb. Optim. 37, No. 2, 668--684 (2019; Zbl 1423.90089) Full Text: DOI
Zhang, Long; Zhang, Yuzhong; Bai, Qingguo Two-stage medical supply chain scheduling with an assignable common due window and shelf life. (English) Zbl 1416.90015 J. Comb. Optim. 37, No. 1, 319-329 (2019). MSC: 90B35 90B05 90C90 PDFBibTeX XMLCite \textit{L. Zhang} et al., J. Comb. Optim. 37, No. 1, 319--329 (2019; Zbl 1416.90015) Full Text: DOI
Ma, Xiaoli; Wu, Baoyindureng; Jin, Xian’an Edge-disjoint spanning trees and the number of maximum state circles of a graph. (English) Zbl 1401.90195 J. Comb. Optim. 35, No. 4, 997-1008 (2018). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{X. Ma} et al., J. Comb. Optim. 35, No. 4, 997--1008 (2018; Zbl 1401.90195) Full Text: DOI
Tang, Qingsong; Peng, Yuejian; Zhang, Xiangde; Zhao, Cheng On Motzkin-Straus type results for non-uniform hypergraphs. (English) Zbl 1406.90123 J. Comb. Optim. 34, No. 2, 504-521 (2017). MSC: 90C35 05C35 05C65 05D99 90C27 PDFBibTeX XMLCite \textit{Q. Tang} et al., J. Comb. Optim. 34, No. 2, 504--521 (2017; Zbl 1406.90123) Full Text: DOI
Ghiyasvand, Mehdi A faster strongly polynomial time algorithm to solve the minimum cost tension problem. (English) Zbl 1407.90324 J. Comb. Optim. 34, No. 1, 203-217 (2017). MSC: 90C35 PDFBibTeX XMLCite \textit{M. Ghiyasvand}, J. Comb. Optim. 34, No. 1, 203--217 (2017; Zbl 1407.90324) Full Text: DOI
Kfoury, Assaf; Mirzaei, Saber Efficient reassembling of graphs. I: The linear case. (English) Zbl 1398.90192 J. Comb. Optim. 33, No. 3, 1057-1089 (2017). MSC: 90C35 PDFBibTeX XMLCite \textit{A. Kfoury} and \textit{S. Mirzaei}, J. Comb. Optim. 33, No. 3, 1057--1089 (2017; Zbl 1398.90192) Full Text: DOI arXiv
Malyshev, D. S. A complexity dichotomy and a new boundary class for the dominating set problem. (English) Zbl 1354.90111 J. Comb. Optim. 32, No. 1, 226-243 (2016). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{D. S. Malyshev}, J. Comb. Optim. 32, No. 1, 226--243 (2016; Zbl 1354.90111) Full Text: DOI
Chang, Yanming; Peng, Yuejian; Yao, Yuping Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs. (English) Zbl 1360.90256 J. Comb. Optim. 31, No. 2, 881-892 (2016). MSC: 90C35 90C30 PDFBibTeX XMLCite \textit{Y. Chang} et al., J. Comb. Optim. 31, No. 2, 881--892 (2016; Zbl 1360.90256) Full Text: DOI
Liu, Tian; Lu, Zhao; Xu, Ke Tractable connected domination for restricted bipartite graphs. (English) Zbl 1319.90075 J. Comb. Optim. 29, No. 1, 247-256 (2015). MSC: 90C35 PDFBibTeX XMLCite \textit{T. Liu} et al., J. Comb. Optim. 29, No. 1, 247--256 (2015; Zbl 1319.90075) Full Text: DOI
Li, Jianping; Li, Weidong; Lichen, Junran The subdivision-constrained routing requests problem. (English) Zbl 1286.90156 J. Comb. Optim. 27, No. 1, 152-163 (2014). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{J. Li} et al., J. Comb. Optim. 27, No. 1, 152--163 (2014; Zbl 1286.90156) Full Text: DOI
Liu, Hong; Zhang, Peng On the generalized multiway cut in trees problem. (English) Zbl 1286.90158 J. Comb. Optim. 27, No. 1, 65-77 (2014). MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{H. Liu} and \textit{P. Zhang}, J. Comb. Optim. 27, No. 1, 65--77 (2014; Zbl 1286.90158) Full Text: DOI
Li, Shasha; Li, Xueliang Note on the hardness of generalized connectivity. (English) Zbl 1261.90078 J. Comb. Optim. 24, No. 3, 389-396 (2012). MSC: 90C35 90C60 90C27 PDFBibTeX XMLCite \textit{S. Li} and \textit{X. Li}, J. Comb. Optim. 24, No. 3, 389--396 (2012; Zbl 1261.90078) Full Text: DOI arXiv
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath FPT algorithms for connected feedback vertex set. (English) Zbl 1258.05060 J. Comb. Optim. 24, No. 2, 131-146 (2012). MSC: 05C40 05C85 05C05 PDFBibTeX XMLCite \textit{N. Misra} et al., J. Comb. Optim. 24, No. 2, 131--146 (2012; Zbl 1258.05060) Full Text: DOI
Zhang, Wei; Zhang, Zhao; Wang, Wei; Zou, Feng; Lee, Wonjun Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks. (English) Zbl 1245.90016 J. Comb. Optim. 23, No. 4, 451-461 (2012). MSC: 90B18 90C59 PDFBibTeX XMLCite \textit{W. Zhang} et al., J. Comb. Optim. 23, No. 4, 451--461 (2012; Zbl 1245.90016) Full Text: DOI
Zhu, Xu; Wang, Wei; Shan, Shan; Wang, Zhong; Wu, Weili A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs. (English) Zbl 1245.90111 J. Comb. Optim. 23, No. 4, 443-450 (2012). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{X. Zhu} et al., J. Comb. Optim. 23, No. 4, 443--450 (2012; Zbl 1245.90111) Full Text: DOI
Chen, Qin; Chen, Xujin Packing cycles exactly in polynomial time. (English) Zbl 1242.90190 J. Comb. Optim. 23, No. 2, 167-188 (2012). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{Q. Chen} and \textit{X. Chen}, J. Comb. Optim. 23, No. 2, 167--188 (2012; Zbl 1242.90190) Full Text: DOI
AlBdaiwi, Bader F.; Ghosh, Diptesh; Goldengorin, Boris Data aggregation for \(p\)-median problems. (English) Zbl 1319.90045 J. Comb. Optim. 21, No. 3, 348-363 (2011). MSC: 90C09 90C27 90B80 PDFBibTeX XMLCite \textit{B. F. AlBdaiwi} et al., J. Comb. Optim. 21, No. 3, 348--363 (2011; Zbl 1319.90045) Full Text: DOI
McClosky, Benjamin; Simms, Anthony; Hicks, Illya V. Co-2-plex polynomials. (English) Zbl 1263.90079 J. Comb. Optim. 22, No. 4, 640-650 (2011). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{B. McClosky} et al., J. Comb. Optim. 22, No. 4, 640--650 (2011; Zbl 1263.90079) Full Text: DOI
Fan, Lidan; Zhang, Zhao; Wang, Wei PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs. (English) Zbl 1236.90135 J. Comb. Optim. 22, No. 4, 663-673 (2011). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{L. Fan} et al., J. Comb. Optim. 22, No. 4, 663--673 (2011; Zbl 1236.90135) Full Text: DOI
Liu, Longcheng; Wu, Biao; Yao, Enyu Minimizing the sum cost in linear extensions of a poset. (English) Zbl 1213.90274 J. Comb. Optim. 21, No. 2, 247-253 (2011). MSC: 90C90 90C27 PDFBibTeX XMLCite \textit{L. Liu} et al., J. Comb. Optim. 21, No. 2, 247--253 (2011; Zbl 1213.90274) Full Text: DOI
Babayev, Djangir A.; Bell, George I.; Nuriyev, Urfat G. The bandpass problem: Combinatorial optimization and library of problems. (English) Zbl 1173.90504 J. Comb. Optim. 18, No. 2, 151-172 (2009). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{D. A. Babayev} et al., J. Comb. Optim. 18, No. 2, 151--172 (2009; Zbl 1173.90504) Full Text: DOI
Liazi, Maria; Milis, Ioannis; Pascual, Fanny; Zissimopoulos, Vassilis The densest \(k\)-subgraph problem on clique graphs. (English) Zbl 1149.90127 J. Comb. Optim. 14, No. 4, 465-474 (2007). MSC: 90C27 90C35 90C39 PDFBibTeX XMLCite \textit{M. Liazi} et al., J. Comb. Optim. 14, No. 4, 465--474 (2007; Zbl 1149.90127) Full Text: DOI
Yang, Xiaoguang; Zhang, Jianzhong Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes. (English) Zbl 1198.90382 J. Comb. Optim. 13, No. 2, 123-135 (2007). MSC: 90C35 68Q25 PDFBibTeX XMLCite \textit{X. Yang} and \textit{J. Zhang}, J. Comb. Optim. 13, No. 2, 123--135 (2007; Zbl 1198.90382) Full Text: DOI
Liu, Longcheng; Zhang, Jianzhong Inverse maximum flow problems under the weighted Hamming distance. (English) Zbl 1126.90070 J. Comb. Optim. 12, No. 4, 395-408 (2006). MSC: 90C35 PDFBibTeX XMLCite \textit{L. Liu} and \textit{J. Zhang}, J. Comb. Optim. 12, No. 4, 395--408 (2006; Zbl 1126.90070) Full Text: DOI
Kovalyov, Mikhail Y.; Portmann, Marie-Claude; Oulamara, Ammar Optimal testing and repairing a failed series system. (English) Zbl 1160.90473 J. Comb. Optim. 12, No. 3, 279-295 (2006). MSC: 90B35 90C10 90B25 PDFBibTeX XMLCite \textit{M. Y. Kovalyov} et al., J. Comb. Optim. 12, No. 3, 279--295 (2006; Zbl 1160.90473) Full Text: DOI
Chen, Zhixiang; Fu, Bin; Tang, Yong; Zhu, Binhai A PTAS for a disc covering problem using width-bounded separators. (English) Zbl 1130.90050 J. Comb. Optim. 11, No. 2, 203-217 (2006). MSC: 90C35 05C85 68W25 90C59 PDFBibTeX XMLCite \textit{Z. Chen} et al., J. Comb. Optim. 11, No. 2, 203--217 (2006; Zbl 1130.90050) Full Text: DOI
Hsu, Tsan-Sheng; Tsai, Kuo-Hui; Wang, Da-Wei; Lee, D. T. Two variations of the minimum Steiner problem. (English) Zbl 1066.90105 J. Comb. Optim. 9, No. 1, 101-120 (2005). MSC: 90C27 90B10 05C35 90C35 PDFBibTeX XMLCite \textit{T.-S. Hsu} et al., J. Comb. Optim. 9, No. 1, 101--120 (2005; Zbl 1066.90105) Full Text: DOI
Gladky, A. A.; Shafransky, Y. M.; Strusevich, V. A. Flow shop scheduling problems under machine-dependent precedence constraints. (English) Zbl 1136.90349 J. Comb. Optim. 8, No. 1, 13-28 (2004). MSC: 90B35 90C35 90C60 PDFBibTeX XMLCite \textit{A. A. Gladky} et al., J. Comb. Optim. 8, No. 1, 13--28 (2004; Zbl 1136.90349) Full Text: DOI
Kellerer, Hans; Pferschy, Ulrich Improved dynamic programming in connection with an FPTAS for the knapsack problem. (English) Zbl 1058.90070 J. Comb. Optim. 8, No. 1, 5-11 (2004). MSC: 90C39 90C09 90C27 68W25 PDFBibTeX XMLCite \textit{H. Kellerer} and \textit{U. Pferschy}, J. Comb. Optim. 8, No. 1, 5--11 (2004; Zbl 1058.90070) Full Text: DOI
Liu, Zhenhong; Zhang, Jianzhong On inverse problems of optimum perfect matching. (English) Zbl 1053.90012 J. Comb. Optim. 7, No. 3, 215-228 (2003). MSC: 90B10 90C05 PDFBibTeX XMLCite \textit{Z. Liu} and \textit{J. Zhang}, J. Comb. Optim. 7, No. 3, 215--228 (2003; Zbl 1053.90012) Full Text: DOI
Plesník, Ján Minimum cost edge subset covering exactly \(k\) vertices of a graph. (English) Zbl 1078.90063 J. Comb. Optim. 5, No. 3, 275-286 (2001). MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{J. Plesník}, J. Comb. Optim. 5, No. 3, 275--286 (2001; Zbl 1078.90063) Full Text: DOI
Dawande, M.; Kalagnanam, J.; Keskinocak, P.; Ravi, R.; Salman, F. S. Approximation algorithms for the multiple knapsack problem with assignment restrictions. (English) Zbl 0970.90106 J. Comb. Optim. 4, No. 2, 171-186 (2000). Reviewer: Thomas M.Liebling (Lausanne) MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{M. Dawande} et al., J. Comb. Optim. 4, No. 2, 171--186 (2000; Zbl 0970.90106) Full Text: DOI
Nagamochi, Hiroshi; Katayama, Shigeki; Ibaraki, Toshihide A faster algorithm for computing minimum 5-way and 6-way cuts in graphs. (English) Zbl 1028.90074 J. Comb. Optim. 4, No. 2, 151-169 (2000). MSC: 90C35 PDFBibTeX XMLCite \textit{H. Nagamochi} et al., J. Comb. Optim. 4, No. 2, 151--169 (2000; Zbl 1028.90074) Full Text: DOI
Ishii, Toshimasa; Nagamochi, Hiroshi; Ibaraki, Toshihide Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph. (English) Zbl 0952.05040 J. Comb. Optim. 4, No. 1, 35-77 (2000). MSC: 05C40 05C85 68R10 90C35 PDFBibTeX XMLCite \textit{T. Ishii} et al., J. Comb. Optim. 4, No. 1, 35--77 (2000; Zbl 0952.05040) Full Text: DOI
Rosenkrantz, Daniel J.; Tayi, Giri K.; Ravi, S. S. Facility dispersion problems under capacity and cost constraints. (English) Zbl 0961.90091 J. Comb. Optim. 4, No. 1, 7-33 (2000). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{D. J. Rosenkrantz} et al., J. Comb. Optim. 4, No. 1, 7--33 (2000; Zbl 0961.90091) Full Text: DOI
Cai, Maocheng; Yang, Xiaoguang; Li, Yanjun Inverse polymatroidal flow problem. (English) Zbl 0957.90126 J. Comb. Optim. 3, No. 1, 115-126 (1999). MSC: 90C35 05B35 PDFBibTeX XMLCite \textit{M. Cai} et al., J. Comb. Optim. 3, No. 1, 115--126 (1999; Zbl 0957.90126) Full Text: DOI
Klinz, Bettina; Woeginger, Gerhard J. The Steiner tree problem in Kalmanson matrices and in circulant matrices. (English) Zbl 0936.05032 J. Comb. Optim. 3, No. 1, 51-58 (1999). MSC: 05C05 68Q25 05C50 90C27 90C39 PDFBibTeX XMLCite \textit{B. Klinz} and \textit{G. J. Woeginger}, J. Comb. Optim. 3, No. 1, 51--58 (1999; Zbl 0936.05032) Full Text: DOI
Fu, Minyue; Luo, Zhi-Quan; Ye, Yinyu Approximation algorithms for quadratic programming. (English) Zbl 0896.90154 J. Comb. Optim. 2, No. 1, 29-50 (1998). MSC: 90C20 PDFBibTeX XMLCite \textit{M. Fu} et al., J. Comb. Optim. 2, No. 1, 29--50 (1998; Zbl 0896.90154) Full Text: DOI
Cai, Pu; Cai, Jin-Yi; Naik, Ashish V. Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns. (English) Zbl 0896.90136 J. Comb. Optim. 1, No. 4, 367-376 (1998). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Cai} et al., J. Comb. Optim. 1, No. 4, 367--376 (1998; Zbl 0896.90136) Full Text: DOI
Yu, Gang; Goldschmidt, Olivier Local optimality and its application on independent sets for \(k\)-claw free graphs. (English) Zbl 0889.90152 J. Comb. Optim. 1, No. 2, 151-164 (1997). MSC: 90C35 90C60 90C27 PDFBibTeX XMLCite \textit{G. Yu} and \textit{O. Goldschmidt}, J. Comb. Optim. 1, No. 2, 151--164 (1997; Zbl 0889.90152) Full Text: DOI