Gimadi, E. Kh.; Tsidulko, O. Yu. On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040 Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020). MSC: 90B80 90B10 90C35 90-01 05C05 68W25 PDFBibTeX XMLCite \textit{E. Kh. Gimadi} and \textit{O. Yu. Tsidulko}, Proc. Steklov Inst. Math. 313, S58--S72 (2021; Zbl 1470.90040); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108--124 (2020) Full Text: DOI
Takayama, Koki; Kobayashi, Yusuke A strongly polynomial time algorithm for the maximum supply rate problem on trees. (English) Zbl 1436.68261 Theor. Comput. Sci. 806, 323-331 (2020). MSC: 68R10 05C05 05C70 05C85 68W40 90B06 90B10 90C39 PDFBibTeX XMLCite \textit{K. Takayama} and \textit{Y. Kobayashi}, Theor. Comput. Sci. 806, 323--331 (2020; Zbl 1436.68261) Full Text: DOI
Borradaile, Glencora; Klein, Philip The two-edge connectivity survivable-network design problem in planar graphs. (English) Zbl 1445.68152 ACM Trans. Algorithms 12, No. 3, Article No. 30, 29 p. (2016). MSC: 68R10 05C40 68W25 90B10 PDFBibTeX XMLCite \textit{G. Borradaile} and \textit{P. Klein}, ACM Trans. Algorithms 12, No. 3, Article No. 30, 29 p. (2016; Zbl 1445.68152) Full Text: DOI arXiv
Bampis, Evripidis; Letsios, Dimitrios; Lucarelli, Giorgio Green scheduling, flows and matchings. (English) Zbl 1312.68030 Theor. Comput. Sci. 579, 126-136 (2015). MSC: 68M20 05C21 05C70 68Q25 68W05 90B35 90C35 PDFBibTeX XMLCite \textit{E. Bampis} et al., Theor. Comput. Sci. 579, 126--136 (2015; Zbl 1312.68030) Full Text: DOI
Seymour, Paul Criticality for multicommodity flows. (English) Zbl 1303.05078 J. Comb. Theory, Ser. B 110, 136-179 (2015). MSC: 05C21 05C05 05C70 05C85 90B10 PDFBibTeX XMLCite \textit{P. Seymour}, J. Comb. Theory, Ser. B 110, 136--179 (2015; Zbl 1303.05078) Full Text: DOI
Andreatta, Giovanni; De Giovanni, Luigi; Serafini, Paolo Optimal shift coloring of trees. (English) Zbl 1408.05056 Oper. Res. Lett. 42, No. 4, 251-256 (2014). MSC: 05C15 05C05 05C85 90B35 PDFBibTeX XMLCite \textit{G. Andreatta} et al., Oper. Res. Lett. 42, No. 4, 251--256 (2014; Zbl 1408.05056) Full Text: DOI
Czumaj, Artur; Czyzowicz, Jurek; Gąsieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Zylinski, Pawel Approximation algorithms for buy-at-bulk geometric network design. (English) Zbl 1233.90079 Int. J. Found. Comput. Sci. 22, No. 8, 1949-1969 (2011). MSC: 90B10 68W25 05C85 90C59 PDFBibTeX XMLCite \textit{A. Czumaj} et al., Int. J. Found. Comput. Sci. 22, No. 8, 1949--1969 (2011; Zbl 1233.90079) Full Text: DOI
Ishii, Toshimasa; Akiyama, Yoko; Nagamochi, Hiroshi Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs. (English) Zbl 1187.05042 Algorithmica 56, No. 4, 413-436 (2010). MSC: 05C40 05C85 68R10 PDFBibTeX XMLCite \textit{T. Ishii} et al., Algorithmica 56, No. 4, 413--436 (2010; Zbl 1187.05042) Full Text: DOI Link
Ishii, Toshimasa Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. (English) Zbl 1162.05328 Discrete Optim. 6, No. 1, 23-36 (2009). MSC: 05C40 90C35 PDFBibTeX XMLCite \textit{T. Ishii}, Discrete Optim. 6, No. 1, 23--36 (2009; Zbl 1162.05328) Full Text: DOI Link
Ishii, Toshimasa; Hagiwara, Masayuki Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. (English) Zbl 1110.68102 Discrete Appl. Math. 154, No. 16, 2307-2329 (2006). MSC: 68R10 05C40 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Ishii} and \textit{M. Hagiwara}, Discrete Appl. Math. 154, No. 16, 2307--2329 (2006; Zbl 1110.68102) Full Text: DOI Link
Jarray, Fethi Solving problems of discrete tomography application in workforce scheduling. (English) Zbl 1101.90356 4OR 3, No. 4, 337-340 (2005). MSC: 90B35 52C45 05B50 68U10 PDFBibTeX XMLCite \textit{F. Jarray}, 4OR 3, No. 4, 337--340 (2005; Zbl 1101.90356) 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
Artigues, Christian; Roubellat, François A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. (English) Zbl 0990.90034 Eur. J. Oper. Res. 127, No. 2, 297-316 (2000). MSC: 90B35 05C90 90C60 PDFBibTeX XMLCite \textit{C. Artigues} and \textit{F. Roubellat}, Eur. J. Oper. Res. 127, No. 2, 297--316 (2000; Zbl 0990.90034) Full Text: DOI
Nemhauser, George L.; Wolsey, Laurence A. Integer and combinatorial optimization. Paperback ed. (English) Zbl 0944.90001 Wiley-Interscience Series in Discrete Mathematics and Optimization. New York, NY: Wiley. xiv, 763 p. (1999). Reviewer: A.Akutowicz (Berlin) MSC: 90-01 90C10 90C27 90B10 52Bxx 05B35 90C35 90C05 68Q25 05C70 PDFBibTeX XMLCite \textit{G. L. Nemhauser} and \textit{L. A. Wolsey}, Integer and combinatorial optimization. Paperback ed. New York, NY: Wiley (1999; Zbl 0944.90001)
Broder, Andrei Z.; Frieze, Alan M.; Suen, Stephen; Upfal, Eli Optimal construction of edge-disjoint paths in random graphs. (English) Zbl 0912.05058 SIAM J. Comput. 28, No. 2, 541-573 (1998). MSC: 05C85 05C38 05C80 05C40 60G50 68W10 68Q25 68R10 90B10 90B18 PDFBibTeX XMLCite \textit{A. Z. Broder} et al., SIAM J. Comput. 28, No. 2, 541--573 (1998; Zbl 0912.05058) Full Text: DOI
Kortsarz, Guy; Peleg, David Approximation algorithms for minimum-time broadcast. (English) Zbl 0829.05056 SIAM J. Discrete Math. 8, No. 3, 401-427 (1995). Reviewer: M.Middendorf (Karlsruhe) MSC: 05C85 05C90 68Q25 90C27 90B35 PDFBibTeX XMLCite \textit{G. Kortsarz} and \textit{D. Peleg}, SIAM J. Discrete Math. 8, No. 3, 401--427 (1995; Zbl 0829.05056) Full Text: DOI
Warren, Richard H. Pyramidal tours for the traveling salesman. (English) Zbl 0819.90125 Optimization 29, No. 1, 81-87 (1994). MSC: 90C35 90C27 05C38 90B35 PDFBibTeX XMLCite \textit{R. H. Warren}, Optimization 29, No. 1, 81--87 (1994; Zbl 0819.90125) Full Text: DOI
Kolountzakis, Mihail N. Selection of a large sum-free subset in polynomial time. (English) Zbl 0789.11066 Inf. Process. Lett. 49, No. 5, 255-256 (1994). MSC: 11Y16 11B75 68W30 05D05 PDFBibTeX XMLCite \textit{M. N. Kolountzakis}, Inf. Process. Lett. 49, No. 5, 255--256 (1994; Zbl 0789.11066) Full Text: DOI
Isaak, Garth Bounded discrete representations of interval orders. (English) Zbl 0787.06003 Discrete Appl. Math. 44, No. 1-3, 157-183 (1993). Reviewer: J.Neggers (Tuscaloosa) MSC: 06A07 05C38 90B10 PDFBibTeX XMLCite \textit{G. Isaak}, Discrete Appl. Math. 44, No. 1--3, 157--183 (1993; Zbl 0787.06003) Full Text: DOI
Shull, Randy; Shuchat, Alan; Orlin, James B.; Lepp, Marianne Recognizing hidden bicircular networks. (English) Zbl 0781.90089 Discrete Appl. Math. 41, No. 1, 13-53 (1993). Reviewer: A.Tucker (Stony Brook) MSC: 90C35 05C38 90B10 05B35 05B20 90C05 90C60 PDFBibTeX XMLCite \textit{R. Shull} et al., Discrete Appl. Math. 41, No. 1, 13--53 (1993; Zbl 0781.90089) Full Text: DOI
Monfroglio, Angelo Integer programs for logic constraint satisfaction. (English) Zbl 0764.90063 Theor. Comput. Sci. 97, No. 1, 105-130 (1992). MSC: 90C10 68T27 05C65 PDFBibTeX XMLCite \textit{A. Monfroglio}, Theor. Comput. Sci. 97, No. 1, 105--130 (1992; Zbl 0764.90063) Full Text: DOI
Williams, Kenneth Determining bandwidth sum for certain graph sums. (English) Zbl 0786.05074 Hoffman, Frederick (ed.) et al., Proceedings of the twenty-third Southeastern international conference on combinatorics, graph theory, and computing, held at Florida Atlantic University, Boca Raton, FL, USA, February 3-7, 1992. Winnipeg: Utilitas Mathematica Publishing Inc.. Congr. Numerantium. 90, 77-86 (1992). MSC: 05C78 05C85 68R10 PDFBibTeX XMLCite \textit{K. Williams}, in: Proceedings of the twenty-third Southeastern international conference on combinatorics, graph theory, and computing, held at Florida Atlantic University, Boca Raton, FL, USA, February 3-7, 1992. Winnipeg: Utilitas Mathematica Publishing Inc.. 77--86 (1992; Zbl 0786.05074)
de Werra, Dominique; Blazewicz, J. Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. (English) Zbl 0756.90054 Discrete Appl. Math. 35, No. 3, 205-219 (1992). Reviewer: M.Kubale (Gdańsk) MSC: 90B35 05C15 05C70 05C99 PDFBibTeX XMLCite \textit{D. de Werra} and \textit{J. Blazewicz}, Discrete Appl. Math. 35, No. 3, 205--219 (1992; Zbl 0756.90054) Full Text: DOI
Jansen, Klaus The processor-optimization problem. (English) Zbl 0737.90034 Operations research, Proc. 15th Symp., Vienna/Austria 1990, Methods Oper. Res. 64, 123-131 (1991). MSC: 90B35 90C60 68M20 90-08 05C70 90B10 PDFBibTeX XMLCite \textit{K. Jansen}, in: Linear time algorithms for linear programming. . 123--131 (1991; Zbl 0737.90034)
Nagamochi, Hiroshi; Ibaraki, Toshihide Multicommodity flows in certain planar directed networks. (English) Zbl 0716.90033 Discrete Appl. Math. 27, No. 1-2, 125-145 (1990). Reviewer: H.Kise MSC: 90B10 05C20 90C60 05C10 90C35 PDFBibTeX XMLCite \textit{H. Nagamochi} and \textit{T. Ibaraki}, Discrete Appl. Math. 27, No. 1--2, 125--145 (1990; Zbl 0716.90033) Full Text: DOI
Hartvigsen, David B.; Wagner, Donald K. Recognizing max-flow min-cut path matrices. (English) Zbl 0645.90020 Oper. Res. Lett. 7, No. 1, 37-42 (1988). Reviewer: K.G.Murty MSC: 90B10 90C10 05B35 90C27 90C05 PDFBibTeX XMLCite \textit{D. B. Hartvigsen} and \textit{D. K. Wagner}, Oper. Res. Lett. 7, No. 1, 37--42 (1988; Zbl 0645.90020) Full Text: DOI
Nakano, Shin-Ichi; Nishizeki, Takao; Saito, Nobuji On the f-coloring of multigraphs. (English) Zbl 0638.05024 IEEE Trans. Circuits Syst. 35, No. 3, 345-353 (1988). MSC: 05C15 68R10 90B35 PDFBibTeX XMLCite \textit{S.-I. Nakano} et al., IEEE Trans. Circuits Syst. 35, No. 3, 345--353 (1988; Zbl 0638.05024) Full Text: DOI
Nemhauser, George L.; Wolsey, Laurence A. Integer and combinatorial optimization. (English) Zbl 0652.90067 Wiley-Interscience Series in Discrete Mathematics and Optimization. New York etc.: Wiley. xiv, 763 p. £70.00 (1988). MSC: 90C10 90-01 90C27 90B10 52Bxx 05B35 90C35 90C05 68Q25 05C70 PDFBibTeX XMLCite \textit{G. L. Nemhauser} and \textit{L. A. Wolsey}, Integer and combinatorial optimization. New York etc.: Wiley (1988; Zbl 0652.90067)
Chin, Wei-Pang; Ntafos, Simeon Optimum zoo-keeper routes. (English) Zbl 0653.90081 Combinatorics, graph theory, and computing, Proc. 18th Southeast. Conf., Boca Raton/Fl. 1987, Congr. Numerantium 58, 257-266 (1987). Reviewer: A.Kolen MSC: 90C35 05C35 90B35 90C27 05C38 52Bxx PDFBibTeX XML
Bixby, R. E.; Marcotte, O. M.-C.; Trotter, L. E. jun. Packing and covering with integral feasible flows in integral supply- demand networks. (English) Zbl 0646.90033 Math. Program. 39, 231-239 (1987). Reviewer: C.Radu MSC: 90B10 90C35 68Q25 05B40 PDFBibTeX XMLCite \textit{R. E. Bixby} et al., Math. Program. 39, 231--239 (1987; Zbl 0646.90033) Full Text: DOI
Truemper, K. Max-flow min-cut matroids: Polynomial testing and polynomial algorithms for maximum flow and shortest routes. (English) Zbl 0616.90014 Math. Oper. Res. 12, 77-96 (1987). Reviewer: K.G.Murty MSC: 90B10 05B35 90C35 90C27 PDFBibTeX XMLCite \textit{K. Truemper}, Math. Oper. Res. 12, 77--96 (1987; Zbl 0616.90014) Full Text: DOI
Edwards, Keith The complexity of colouring problems on dense graphs. (English) Zbl 0597.68038 Theor. Comput. Sci. 43, 337-343 (1986). MSC: 68Q25 05C15 05C30 PDFBibTeX XMLCite \textit{K. Edwards}, Theor. Comput. Sci. 43, 337--343 (1986; Zbl 0597.68038) Full Text: DOI
Richter, K. The robot sequencing problem: Polynomial algorithm and complexity. (English) Zbl 0586.90052 Optimization 16, 597-605 (1985). Reviewer: J.Blazewicz MSC: 90B35 68Q25 05C35 PDFBibTeX XMLCite \textit{K. Richter}, Optimization 16, 597--605 (1985; Zbl 0586.90052) Full Text: DOI
Furst, Merrick; Lipton, Richard; Stockmeyer, Larry Pseudorandom number generation and space complexity. (English) Zbl 0575.68048 Inf. Control 64, 43-51 (1985). MSC: 68Q25 65C10 05C70 68R10 PDFBibTeX XMLCite \textit{M. Furst} et al., Inf. Control 64, 43--51 (1985; Zbl 0575.68048) Full Text: DOI
Sysło, Maciej M. On the computational complexity of the minimum-dummy-activities problem in a PERT network. (English) Zbl 0543.90057 Networks 14, 37-45 (1984). MSC: 90B35 90C35 68Q25 05C35 05C20 68R10 PDFBibTeX XMLCite \textit{M. M. Sysło}, Networks 14, 37--45 (1984; Zbl 0543.90057) Full Text: DOI
Furst, Merrick; Lipton, Richard; Stockmeyer, Larry Pseudorandom number generation and space complexity. (English) Zbl 0549.68032 Foundations of computation theory, Proc. int. FCT-Conf., Borgholm/Swed. 1983, Lect. Notes Comput. Sci. 158, 171-176 (1983). MSC: 68Q25 65C10 68R10 05C70 PDFBibTeX XML
Berenguer, X.; Diaz, J.; Harper, L. H. A solution of the Sperner-Erdős problem. (English) Zbl 0498.90027 Theor. Comput. Sci. 21, 99-103 (1982). MSC: 90B10 05C38 68R10 68Q25 90C35 PDFBibTeX XMLCite \textit{X. Berenguer} et al., Theor. Comput. Sci. 21, 99--103 (1982; Zbl 0498.90027) Full Text: DOI
Cunningham, William H.; Frank, Andras A primal-dual algorithm for submodular flows. (English) Zbl 0494.90023 Rep., Inst. Ökon. Oper. Res., Rheinische Friedrich-Wilhelms-Univ., Bonn 82224-OR, 20 p. (1982). MSC: 90B10 90C35 68Q25 05C35 PDFBibTeX XML
Tsukiyama, Shuji; Kuh, Ernest S. Double-row planar routing and permutation layout. (English) Zbl 0489.94040 Networks 12, 287-316 (1982). MSC: 94C99 05A05 90B10 68Q25 68R99 PDFBibTeX XMLCite \textit{S. Tsukiyama} and \textit{E. S. Kuh}, Networks 12, 287--316 (1982; Zbl 0489.94040) Full Text: DOI
Kolen, A. The p-median problem with mutual communication on a tree. (English) Zbl 0417.90085 Math. Cent., Amst., Afd. Math. Beslisk. BW 114/79, 11 p. (1979). MSC: 90C35 90B99 90B10 05C05 PDFBibTeX XML
Cook, Stephen; Sethi, Ravi Storage requirements for deterministic polynomial time recognizable languages. (English) Zbl 0412.68078 Proc. 6th ann. ACM Symp. Theory Comput., Seattle 1974, 33-39 (1974). MSC: 68Q45 68Q25 68N20 05C20 PDFBibTeX XML