Korže, Danilo; Markuš, Žiga; Vesel, Aleksander A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices. (English) Zbl 1406.05105 Discrete Appl. Math. 257, 353-358 (2019). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{D. Korže} et al., Discrete Appl. Math. 257, 353--358 (2019; Zbl 1406.05105) Full Text: DOI
Cafieri, Sonia; Hansen, Pierre; Liberti, Leo Improving heuristics for network modularity maximization using an exact algorithm. (English) Zbl 1303.90112 Discrete Appl. Math. 163, Part 1, 65-72 (2014). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{S. Cafieri} et al., Discrete Appl. Math. 163, Part 1, 65--72 (2014; Zbl 1303.90112) Full Text: DOI
Il’ev, Victor P. An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. (English) Zbl 1168.90585 Discrete Appl. Math. 114, No. 1-3, 131-146 (2001). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{V. P. Il'ev}, Discrete Appl. Math. 114, No. 1--3, 131--146 (2001; Zbl 1168.90585) Full Text: DOI
Polzin, Tobias; Daneshmand, Siavash Vahdati Improved algorithms for the Steiner problem in networks. (English) Zbl 0994.90135 Discrete Appl. Math. 112, No. 1-3, 263-300 (2001). Reviewer: Ján Plesník (Bratislava) MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{T. Polzin} and \textit{S. V. Daneshmand}, Discrete Appl. Math. 112, No. 1--3, 263--300 (2001; Zbl 0994.90135) Full Text: DOI
Pisinger, David A fast algorithm for strongly correlated knapsack problems. (English) Zbl 0921.90122 Discrete Appl. Math. 89, No. 1-3, 197-212 (1998). MSC: 90C09 90C39 PDFBibTeX XMLCite \textit{D. Pisinger}, Discrete Appl. Math. 89, No. 1--3, 197--212 (1998; Zbl 0921.90122) Full Text: DOI
Gallo, Giorgio; Piccinonno, Fulvio b9000A 1/4 approximate algorithm for P2/tree/Cmax. (English) Zbl 0872.90046 Discrete Appl. Math. 72, No. 1-2, 85-98 (1997). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{G. Gallo} and \textit{F. Piccinonno}, Discrete Appl. Math. 72, No. 1--2, 85--98 (1997; Zbl 0872.90046) Full Text: DOI Link
Lee, Chung-Yee; Li, Chung-Lun On the fixed interval due-date scheduling problem. (English) Zbl 0846.90051 Discrete Appl. Math. 68, No. 1-2, 101-117 (1996). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{C.-Y. Lee} and \textit{C.-L. Li}, Discrete Appl. Math. 68, No. 1--2, 101--117 (1996; Zbl 0846.90051) Full Text: DOI
Mingozzi, Aristide; Ricciardelli, Salvatore; Spadoni, Massimo Partitioning a matrix to minimize the maximum cost. (English) Zbl 0833.90086 Discrete Appl. Math. 62, No. 1-3, 221-248 (1995). MSC: 90C09 90C27 PDFBibTeX XMLCite \textit{A. Mingozzi} et al., Discrete Appl. Math. 62, No. 1--3, 221--248 (1995; Zbl 0833.90086) Full Text: DOI
Eglese, R. W. Routeing winter gritting vehicles. (English) Zbl 0790.90031 Discrete Appl. Math. 48, No. 3, 231-244 (1994). MSC: 90B06 90C90 90-08 PDFBibTeX XMLCite \textit{R. W. Eglese}, Discrete Appl. Math. 48, No. 3, 231--244 (1994; Zbl 0790.90031) Full Text: DOI
Lee, Chung-Yee; Liman, Surya Danusaputro Capacitated two-parallel machines scheduling to minimize sum of job completion times. (English) Zbl 0778.90028 Discrete Appl. Math. 41, No. 3, 211-222 (1993). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{C.-Y. Lee} and \textit{S. D. Liman}, Discrete Appl. Math. 41, No. 3, 211--222 (1993; Zbl 0778.90028) Full Text: DOI
Allwright, James New \(({\Delta{}}, D)\) graphs discovered by heuristic search. (English) Zbl 0768.05085 Discrete Appl. Math. 37-38, 3-8 (1992). MSC: 05C85 05C12 68P10 PDFBibTeX XMLCite \textit{J. Allwright}, Discrete Appl. Math. 37--38, 3--8 (1992; Zbl 0768.05085) Full Text: DOI
Naddef, Denis; Santos, Cipriano One-pass batching algorithms for the one-machine problem. (English) Zbl 0661.90044 Discrete Appl. Math. 21, No. 2, 133-145 (1988). Reviewer: S.K.Goyal MSC: 90B35 65K05 PDFBibTeX XMLCite \textit{D. Naddef} and \textit{C. Santos}, Discrete Appl. Math. 21, No. 2, 133--145 (1988; Zbl 0661.90044) Full Text: DOI
Luna, Henrique Pacca L.; Ziviani, Nivio; Cabral, Regina Helena B. The telephonic switching centre network problem: Formalization and computational experience. (English) Zbl 0628.90087 Discrete Appl. Math. 18, 199-210 (1987). MSC: 90C35 05C35 65K05 90C10 94C15 PDFBibTeX XMLCite \textit{H. P. L. Luna} et al., Discrete Appl. Math. 18, 199--210 (1987; Zbl 0628.90087) Full Text: DOI
Hall, Nicholas G.; Hochbaum, Dorit S. A fast approximation algorithm for the multicovering problem. (English) Zbl 0602.90110 Discrete Appl. Math. 15, 35-40 (1986). Reviewer: A.P.Bosznay MSC: 90C27 90C10 68Q25 90C09 PDFBibTeX XMLCite \textit{N. G. Hall} and \textit{D. S. Hochbaum}, Discrete Appl. Math. 15, 35--40 (1986; Zbl 0602.90110) Full Text: DOI
Ribeiro, Celso C.; Minoux, Michel A heuristic approach to hard constrained shortest path problems. (English) Zbl 0574.90085 Discrete Appl. Math. 10, 125-137 (1985). MSC: 90C35 65K05 68Q25 PDFBibTeX XMLCite \textit{C. C. Ribeiro} and \textit{M. Minoux}, Discrete Appl. Math. 10, 125--137 (1985; Zbl 0574.90085) Full Text: DOI
Frieze, A. M. An extension of Christofides heuristic to the k-person travelling salesman problem. (English) Zbl 0508.90085 Discrete Appl. Math. 6, 79-83 (1983). MSC: 90C35 65K05 90C10 68Q25 PDFBibTeX XMLCite \textit{A. M. Frieze}, Discrete Appl. Math. 6, 79--83 (1983; Zbl 0508.90085) Full Text: DOI
Hariri, A. M. A.; Potts, C. N. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. (English) Zbl 0498.90044 Discrete Appl. Math. 5, 99-109 (1983). MSC: 90B35 65K10 PDFBibTeX XMLCite \textit{A. M. A. Hariri} and \textit{C. N. Potts}, Discrete Appl. Math. 5, 99--109 (1983; Zbl 0498.90044) Full Text: DOI