Bhattacharya, Anushree; Pal, Madhumangal Fuzzy covering problem of fuzzy graphs and its application to investigate the Indian economy in new normal. (English) Zbl 1487.05218 J. Appl. Math. Comput. 68, No. 1, 479-510 (2022). MSC: 05C72 05C90 PDFBibTeX XMLCite \textit{A. Bhattacharya} and \textit{M. Pal}, J. Appl. Math. Comput. 68, No. 1, 479--510 (2022; Zbl 1487.05218) Full Text: DOI
Bhattacharya, Anushree; Pal, Madhumangal Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs. (English) Zbl 1498.05256 Soft Comput. 25, No. 10, 7095-7118 (2021). MSC: 05C85 05C90 05C72 05C69 90C35 90C70 PDFBibTeX XMLCite \textit{A. Bhattacharya} and \textit{M. Pal}, Soft Comput. 25, No. 10, 7095--7118 (2021; Zbl 1498.05256) Full Text: DOI
Mandal, Sonia; Patra, Nupur; Pal, Madhumangal Covering problem on fuzzy graphs and its application in disaster management system. (English) Zbl 1491.05154 Soft Comput. 25, No. 4, 2545-2557 (2021). MSC: 05C72 05C70 05C90 PDFBibTeX XMLCite \textit{S. Mandal} et al., Soft Comput. 25, No. 4, 2545--2557 (2021; Zbl 1491.05154) Full Text: DOI
Albareda-Sambola, Maria; Landete, Mercedes; Monge, Juan F.; Sainz-Pardo, José L. Introducing capacities in the location of unreliable facilities. (English) Zbl 1394.90382 Eur. J. Oper. Res. 259, No. 1, 175-188 (2017). MSC: 90B80 90B30 90B25 90C10 90C35 05C85 PDFBibTeX XMLCite \textit{M. Albareda-Sambola} et al., Eur. J. Oper. Res. 259, No. 1, 175--188 (2017; Zbl 1394.90382) Full Text: DOI Link
Prakash, Satya; Agrawal, Anil Kumar; Gupta, Anuj; Garg, Shruti; Jain, Smriti; Sharma, Sidhant; Jamwal, Sushen Singh A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition. (English) Zbl 1397.90386 Opsearch 51, No. 2, 183-200 (2014). MSC: 90C35 05C85 05C45 90C29 PDFBibTeX XMLCite \textit{S. Prakash} et al., Opsearch 51, No. 2, 183--200 (2014; Zbl 1397.90386) Full Text: DOI
Swiercz, Aleksandra; Burke, Edmund K.; Cichenski, Sanja; Zurkowski, Tomasz; Blazewicz, Jacek Unified encoding for hyper-heuristics with application to bioinformatics. (English) Zbl 1339.90342 CEJOR, Cent. Eur. J. Oper. Res. 22, No. 3, 567-589 (2014). MSC: 90C59 90C27 68W01 92D20 05C85 90C25 PDFBibTeX XMLCite \textit{A. Swiercz} et al., CEJOR, Cent. Eur. J. Oper. Res. 22, No. 3, 567--589 (2014; Zbl 1339.90342) Full Text: DOI
Bode, Claudia; Irnich, Stefan The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem. (English) Zbl 1338.90423 Eur. J. Oper. Res. 238, No. 2, 415-426 (2014). MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{C. Bode} and \textit{S. Irnich}, Eur. J. Oper. Res. 238, No. 2, 415--426 (2014; Zbl 1338.90423) Full Text: DOI
Batista-Galván, María; Riera-Ledesma, Jorge; Salazar-González, Juan José The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach. (English) Zbl 1348.90067 Comput. Oper. Res. 40, No. 8, 2103-2115 (2013). MSC: 90B06 05C90 90C35 90C57 PDFBibTeX XMLCite \textit{M. Batista-Galván} et al., Comput. Oper. Res. 40, No. 8, 2103--2115 (2013; Zbl 1348.90067) Full Text: DOI
Demeyer, Sofie; Goedgebeur, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet Speeding up Martins’ algorithm for multiple objective shortest path problems. (English) Zbl 1292.90266 4OR 11, No. 4, 323-348 (2013). MSC: 90C29 05C85 05C38 68Q25 90B06 PDFBibTeX XMLCite \textit{S. Demeyer} et al., 4OR 11, No. 4, 323--348 (2013; Zbl 1292.90266) Full Text: DOI Link
Rana, Akul; Pal, Anita; Pal, Madhumangal The conditional covering problem on unweighted interval graphs with nonuniform coverage radius. (English) Zbl 1262.05146 Math. Comput. Sci. 6, No. 1, 33-41 (2012). MSC: 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{A. Rana} et al., Math. Comput. Sci. 6, No. 1, 33--41 (2012; Zbl 1262.05146) Full Text: DOI
Rana, Akul; Pal, Anita; Pal, Madhumangal An efficient algorithm to solve the conditional covering problem on trapezoid graphs. (English) Zbl 1238.05260 ISRN Discrete Math. 2011, Article ID 213084, 10 p. (2011). MSC: 05C85 05C12 05B40 PDFBibTeX XMLCite \textit{A. Rana} et al., ISRN Discrete Math. 2011, Article ID 213084, 10 p. (2011; Zbl 1238.05260) Full Text: DOI
Caprara, Alberto; Letchford, Adam N. New techniques for cost sharing in combinatorial optimization games. (English) Zbl 1194.91036 Math. Program. 124, No. 1-2 (B), 93-118 (2010). MSC: 91A12 91A46 05C57 90C05 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{A. Caprara} and \textit{A. N. Letchford}, Math. Program. 124, No. 1--2 (B), 93--118 (2010; Zbl 1194.91036) Full Text: DOI Link
Pessoa, Artur; Uchoa, Eduardo; De Aragão, Marcus Poggi A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. (English) Zbl 1205.90081 Networks 54, No. 4, 167-177 (2009). MSC: 90B20 90C57 05C85 PDFBibTeX XMLCite \textit{A. Pessoa} et al., Networks 54, No. 4, 167--177 (2009; Zbl 1205.90081) Full Text: DOI
Kabadi, Santosh N. New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization. (English) Zbl 0996.90062 Discrete Appl. Math. 119, No. 1-2, 149-167 (2002). Reviewer: Volker Kaibel (Berlin) MSC: 90C27 90C59 05C85 90C35 PDFBibTeX XMLCite \textit{S. N. Kabadi}, Discrete Appl. Math. 119, No. 1--2, 149--167 (2002; Zbl 0996.90062) Full Text: DOI
Sotskov, Yu. N.; Leontev, V. K.; Gordeev, E. N. Some concepts of stability analysis in combinatorial optimization. (English) Zbl 0833.90098 Discrete Appl. Math. 58, No. 2, 169-190 (1995). MSC: 90C27 90C31 05C05 90B35 90B80 05C38 PDFBibTeX XMLCite \textit{Yu. N. Sotskov} et al., Discrete Appl. Math. 58, No. 2, 169--190 (1995; Zbl 0833.90098) Full Text: DOI
Richey, Michael B.; Punnen, Abraham P. Minimum perfect bipartite matchings and spanning trees under categorization. (English) Zbl 0776.05088 Discrete Appl. Math. 39, No. 2, 147-153 (1992). Reviewer: M.Koman (Praha) MSC: 05C70 05C85 05C05 PDFBibTeX XMLCite \textit{M. B. Richey} and \textit{A. P. Punnen}, Discrete Appl. Math. 39, No. 2, 147--153 (1992; Zbl 0776.05088) Full Text: DOI
Avis, David; Fukuda, Komei A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. (English) Zbl 0752.68082 Discrete Comput. Geom. 8, No. 3, 295-313 (1992). MSC: 68U05 05A15 52B55 PDFBibTeX XMLCite \textit{D. Avis} and \textit{K. Fukuda}, Discrete Comput. Geom. 8, No. 3, 295--313 (1992; Zbl 0752.68082) Full Text: DOI
Ramamurthy, K. G.; Parthasarathy, T. Matroidal games. (English) Zbl 0593.90090 Int. J. Game Theory 15, 21-29 (1986). Reviewer: A.Mareš MSC: 91A12 05B35 PDFBibTeX XMLCite \textit{K. G. Ramamurthy} and \textit{T. Parthasarathy}, Int. J. Game Theory 15, 21--29 (1986; Zbl 0593.90090) Full Text: DOI
Klingman, Darwin D.; Schneider, Robert F. Microcomputer-based algorithms for large scale shortest path problems. (English) Zbl 0586.90086 Discrete Appl. Math. 13, 183-206 (1986). MSC: 90C35 05C35 65K05 05C38 PDFBibTeX XMLCite \textit{D. D. Klingman} and \textit{R. F. Schneider}, Discrete Appl. Math. 13, 183--206 (1986; Zbl 0586.90086) Full Text: DOI
Ong, Hoon Liong Approximate algorithms for the travelling purchaser problem. (English) Zbl 0504.90078 Oper. Res. Lett. 1, 201-205 (1982). MSC: 90C35 90B35 65K05 68R10 94C15 05C38 PDFBibTeX XMLCite \textit{H. L. Ong}, Oper. Res. Lett. 1, 201--205 (1982; Zbl 0504.90078) Full Text: DOI
Christofides, N.; Mingozzi, A.; Toth, P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. (English) Zbl 0461.90067 Math. Program. 20, 255-282 (1981). MSC: 90C35 65K05 05C35 90C39 05C05 PDFBibTeX XMLCite \textit{N. Christofides} et al., Math. Program. 20, 255--282 (1981; Zbl 0461.90067) Full Text: DOI