Çela, Eranda; Klinz, Bettina; Lendl, Stefan; Woeginger, Gerhard J.; Wulf, Lasse A linear time algorithm for linearizing quadratic and higher-order shortest path problems. (English) Zbl 1528.90209 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 466-479 (2023). MSC: 90C27 90C20 PDFBibTeX XMLCite \textit{E. Çela} et al., Lect. Notes Comput. Sci. 13904, 466--479 (2023; Zbl 1528.90209) Full Text: DOI arXiv
Lendl, Stefan; Woeginger, Gerhard; Wulf, Lasse Non-preemptive tree packing. (English) Zbl 1506.68078 Algorithmica 85, No. 3, 783-804 (2023). MSC: 68R10 05C40 05C85 90B35 90C27 PDFBibTeX XMLCite \textit{S. Lendl} et al., Algorithmica 85, No. 3, 783--804 (2023; Zbl 1506.68078) Full Text: DOI
Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. The bipartite travelling salesman problem: A pyramidally solvable case. arXiv:2302.05161 Preprint, arXiv:2302.05161 [math.OC] (2023). MSC: 90C27 BibTeX Cite \textit{V. G. Deineko} et al., ``The bipartite travelling salesman problem: A pyramidally solvable case'', Preprint, arXiv:2302.05161 [math.OC] (2023) Full Text: arXiv OA License
Fischer, Dennis; Muluk, Komal; Woeginger, Gerhard J. A note on the complexity of the bilevel bottleneck assignment problem. (English) Zbl 1507.90141 4OR 20, No. 4, 713-718 (2022). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{D. Fischer} et al., 4OR 20, No. 4, 713--718 (2022; Zbl 1507.90141) Full Text: DOI
Hartmann, Tim A.; Lendl, Stefan; Woeginger, Gerhard J. Continuous facility location on graphs. (English) Zbl 1489.90155 Math. Program. 192, No. 1-2 (B), 207-227 (2022). MSC: 90C27 68Q25 05C85 PDFBibTeX XMLCite \textit{T. A. Hartmann} et al., Math. Program. 192, No. 1--2 (B), 207--227 (2022; Zbl 1489.90155) Full Text: DOI
Lachmann, Thomas; Lendl, Stefan; Woeginger, Gerhard J. A linear time algorithm for the robust recoverable selection problem. (English) Zbl 1477.90052 Discrete Appl. Math. 303, 94-107 (2021). MSC: 90C17 90C27 PDFBibTeX XMLCite \textit{T. Lachmann} et al., Discrete Appl. Math. 303, 94--107 (2021; Zbl 1477.90052) Full Text: DOI
Woeginger, Gerhard J. The trouble with the second quantifier. (English) Zbl 1473.90146 4OR 19, No. 2, 157-181 (2021). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{G. J. Woeginger}, 4OR 19, No. 2, 157--181 (2021; Zbl 1473.90146) Full Text: DOI
Pieterse, Astrid; Woeginger, Gerhard J. The subset sum game revisited. (English) Zbl 1470.91058 Theory Comput. Syst. 65, No. 5, 884-900 (2021). MSC: 91A46 91A05 91A68 68Q17 PDFBibTeX XMLCite \textit{A. Pieterse} and \textit{G. J. Woeginger}, Theory Comput. Syst. 65, No. 5, 884--900 (2021; Zbl 1470.91058) Full Text: DOI
de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard Fine-grained complexity analysis of two classic TSP variants. (English) Zbl 07471490 ACM Trans. Algorithms 17, No. 1, Article No. 5, 29 p. (2021). MSC: 68Q25 90C27 90C59 PDFBibTeX XMLCite \textit{M. de Berg} et al., ACM Trans. Algorithms 17, No. 1, Article No. 5, 29 p. (2020; Zbl 07471490) Full Text: DOI Link
Fischer, Dennis; Woeginger, Gerhard J. A faster algorithm for the continuous bilevel knapsack problem. (English) Zbl 1525.90354 Oper. Res. Lett. 48, No. 6, 784-786 (2020). MSC: 90C27 90C05 90C30 PDFBibTeX XMLCite \textit{D. Fischer} and \textit{G. J. Woeginger}, Oper. Res. Lett. 48, No. 6, 784--786 (2020; Zbl 1525.90354) Full Text: DOI
Cela, Eranda; Deineko, Vladimir G.; Woeginger, Gerhard J. Travelling salesman paths on Demidenko matrices. arXiv:2009.14746 Preprint, arXiv:2009.14746 [cs.DS] (2020). MSC: 90C27 BibTeX Cite \textit{E. Cela} et al., ``Travelling salesman paths on Demidenko matrices'', Preprint, arXiv:2009.14746 [cs.DS] (2020) Full Text: arXiv OA License
Ficker, Annette M. C.; Spieksma, Frits C. R.; Woeginger, Gerhard J. Robust balanced optimization. (English) Zbl 1417.90127 EURO J. Comput. Optim. 6, No. 3, 239-266 (2018). MSC: 90C27 PDFBibTeX XMLCite \textit{A. M. C. Ficker} et al., EURO J. Comput. Optim. 6, No. 3, 239--266 (2018; Zbl 1417.90127) Full Text: DOI Link
Woeginger, Gerhard J. Some easy and some not so easy geometric optimization problems. (English) Zbl 1520.68205 Epstein, Leah (ed.) et al., Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11312, 3-18 (2018). MSC: 68U05 68Q25 68W25 90C27 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Lect. Notes Comput. Sci. 11312, 3--18 (2018; Zbl 1520.68205) Full Text: DOI
Çela, Eranda; Deineko, Vladimir; Woeginger, Gerhard J. New special cases of the quadratic assignment problem with diagonally structured coefficient matrices. (English) Zbl 1403.90471 Eur. J. Oper. Res. 267, No. 3, 818-834 (2018). MSC: 90B80 90C27 PDFBibTeX XMLCite \textit{E. Çela} et al., Eur. J. Oper. Res. 267, No. 3, 818--834 (2018; Zbl 1403.90471) Full Text: DOI arXiv Link
Çela, Eranda; Deineko, Vladimir G.; Woeginger, Gerhard J. The multi-stripe travelling salesman problem. (English) Zbl 1380.90232 Ann. Oper. Res. 259, No. 1-2, 21-34 (2017). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{E. Çela} et al., Ann. Oper. Res. 259, No. 1--2, 21--34 (2017; Zbl 1380.90232) Full Text: DOI arXiv
Ficker, Annette M. C.; Spieksma, Frits C. R.; Woeginger, Gerhard J. Balanced optimization with vector costs. (English) Zbl 1484.68067 Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 92-102 (2017). MSC: 68Q25 68W25 90C27 PDFBibTeX XMLCite \textit{A. M. C. Ficker} et al., Lect. Notes Comput. Sci. 10138, 92--102 (2017; Zbl 1484.68067) Full Text: DOI
de Berg, Mark; Buchin, Kevin; Jansen, Bart M. P.; Woeginger, Gerhard Fine-grained complexity analysis of two classic TSP variants. (English) Zbl 1388.68139 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 5, 14 p. (2016). MSC: 68Q25 90C27 90C59 PDFBibTeX XMLCite \textit{M. de Berg} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 5, 14 p. (2016; Zbl 1388.68139) Full Text: DOI arXiv
Caprara, Alberto; Carvalho, Margarida; Lodi, Andrea; Woeginger, Gerhard J. Bilevel knapsack with interdiction constraints. (English) Zbl 1343.90075 INFORMS J. Comput. 28, No. 2, 319-333 (2016). MSC: 90C27 90C10 90C47 PDFBibTeX XMLCite \textit{A. Caprara} et al., INFORMS J. Comput. 28, No. 2, 319--333 (2016; Zbl 1343.90075) Full Text: DOI
Çela, Eranda; Deineko, Vladimir G.; Woeginger, Gerhard J. Linearizable special cases of the QAP. (English) Zbl 1344.90053 J. Comb. Optim. 31, No. 3, 1269-1279 (2016). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{E. Çela} et al., J. Comb. Optim. 31, No. 3, 1269--1279 (2016; Zbl 1344.90053) Full Text: DOI arXiv
Epstein, Leah; Levin, Asaf; Woeginger, Gerhard J. Vertex cover meets scheduling. (English) Zbl 1333.68209 Algorithmica 74, No. 3, 1148-1173 (2016). MSC: 68R10 68M20 68W25 90B35 90C27 PDFBibTeX XMLCite \textit{L. Epstein} et al., Algorithmica 74, No. 3, 1148--1173 (2016; Zbl 1333.68209) Full Text: DOI
Ćustić, Ante; Klinz, Bettina; Woeginger, Gerhard J. Geometric versions of the three-dimensional assignment problem under general norms. (English) Zbl 1387.90212 Discrete Optim. 18, 38-55 (2015). MSC: 90C27 90C60 90B80 PDFBibTeX XMLCite \textit{A. Ćustić} et al., Discrete Optim. 18, 38--55 (2015; Zbl 1387.90212) Full Text: DOI arXiv
Çela, Eranda; Deineko, Vladimir G.; Woeginger, Gerhard J. A new tractable case of the QAP with a Robinson matrix. (English) Zbl 1384.90079 Lu, Zaixin (ed.) et al., Combinatorial optimization and applications. 9th international conference, COCOA 2015, Houston, TX, USA, December 18–20, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-26625-1/pbk; 978-3-319-26626-8/ebook). Lecture Notes in Computer Science 9486, 709-720 (2015). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{E. Çela} et al., Lect. Notes Comput. Sci. 9486, 709--720 (2015; Zbl 1384.90079) Full Text: DOI
Çela, Eranda; Deineko, Vladimir G.; Woeginger, Gerhard J. Well-solvable cases of the QAP with block-structured matrices. (English) Zbl 1323.90057 Discrete Appl. Math. 186, 56-65 (2015). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{E. Çela} et al., Discrete Appl. Math. 186, 56--65 (2015; Zbl 1323.90057) Full Text: DOI arXiv
Deineko, Vladimir G.; Klinz, Bettina; Tiskin, Alexander; Woeginger, Gerhard J. Four-point conditions for the TSP: the complete complexity classification. (English) Zbl 1308.90145 Discrete Optim. 14, 147-159 (2014). MSC: 90C27 90C60 68Q25 90C35 PDFBibTeX XMLCite \textit{V. G. Deineko} et al., Discrete Optim. 14, 147--159 (2014; Zbl 1308.90145) Full Text: DOI
Caprara, Alberto; Carvalho, Margarida; Lodi, Andrea; Woeginger, Gerhard J. A study on the computational complexity of the bilevel knapsack problem. (English) Zbl 1297.90134 SIAM J. Optim. 24, No. 2, 823-838 (2014). MSC: 90C27 90C59 90C60 PDFBibTeX XMLCite \textit{A. Caprara} et al., SIAM J. Optim. 24, No. 2, 823--838 (2014; Zbl 1297.90134) Full Text: DOI Link
Ćustić, Ante; Klinz, Bettina; Woeginger, Gerhard J. Planar 3-dimensional assignment problems with Monge-like cost arrays. arXiv:1405.5210 Preprint, arXiv:1405.5210 [math.OC] (2014). MSC: 90C27 BibTeX Cite \textit{A. Ćustić} et al., ``Planar 3-dimensional assignment problems with Monge-like cost arrays'', Preprint, arXiv:1405.5210 [math.OC] (2014) Full Text: arXiv OA License
Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. Uniqueness in quadratic and hyperbolic \(0-1\) programming problems. (English) Zbl 1287.90045 Oper. Res. Lett. 41, No. 6, 633-635 (2013). MSC: 90C20 90C27 90C60 PDFBibTeX XMLCite \textit{V. G. Deineko} et al., Oper. Res. Lett. 41, No. 6, 633--635 (2013; Zbl 1287.90045) Full Text: DOI arXiv
Eggermont, Christian E. J.; Schrijver, Alexander; Woeginger, Gerhard J. Analysis of multi-stage open shop processing systems. (English) Zbl 1282.90067 Math. Program. 142, No. 1-2 (A), 331-348 (2013). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{C. E. J. Eggermont} et al., Math. Program. 142, No. 1--2 (A), 331--348 (2013; Zbl 1282.90067) Full Text: DOI arXiv Link
Deineko, Vladimir G.; Woeginger, Gerhard J. Complexity and in-approximability of a selection problem in robust optimization. (English) Zbl 1287.90085 4OR 11, No. 3, 249-252 (2013). MSC: 90C47 68Q17 62F35 90C27 90C39 PDFBibTeX XMLCite \textit{V. G. Deineko} and \textit{G. J. Woeginger}, 4OR 11, No. 3, 249--252 (2013; Zbl 1287.90085) Full Text: DOI
Polyakovskiy, Sergey; Spieksma, Frits C. R.; Woeginger, Gerhard J. The three-dimensional matching problem in kalmanson matrices. (English) Zbl 1275.90083 J. Comb. Optim. 26, No. 1, 1-9 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{S. Polyakovskiy} et al., J. Comb. Optim. 26, No. 1, 1--9 (2013; Zbl 1275.90083) Full Text: DOI
Caprara, Alberto; Carvalho, Margarida; Lodi, Andrea; Woeginger, Gerhard J. A complexity and approximability study of the bilevel knapsack problem. (English) Zbl 1372.90088 Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 98-109 (2013). MSC: 90C27 68W25 90C60 91A65 PDFBibTeX XMLCite \textit{A. Caprara} et al., Lect. Notes Comput. Sci. 7801, 98--109 (2013; Zbl 1372.90088) Full Text: DOI
Çela, Eranda; Deineko, Vladimir; Woeginger, Gerhard J. The \(x\)-and-\(y\)-axes travelling salesman problem. (English) Zbl 1292.90244 Eur. J. Oper. Res. 223, No. 2, 333-345 (2012). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{E. Çela} et al., Eur. J. Oper. Res. 223, No. 2, 333--345 (2012; Zbl 1292.90244) Full Text: DOI
Hurkens, C. A. J.; Lodi, A.; Martello, S.; Monaci, M.; Woeginger, G. J. Complexity and approximation of an area packing problem. (English) Zbl 1257.90083 Optim. Lett. 6, No. 1, 1-9 (2012). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{C. A. J. Hurkens} et al., Optim. Lett. 6, No. 1, 1--9 (2012; Zbl 1257.90083) Full Text: DOI
Çela, Eranda; Deineko, Vladimir G.; Woeginger, Gerhard J. Another well-solvable case of the QAP: maximizing the job completion time variance. (English) Zbl 1250.90045 Oper. Res. Lett. 40, No. 5, 356-359 (2012). MSC: 90B80 90C27 PDFBibTeX XMLCite \textit{E. Çela} et al., Oper. Res. Lett. 40, No. 5, 356--359 (2012; Zbl 1250.90045) Full Text: DOI
Csorba, Péter; Hurkens, Cor A. J.; Woeginger, Gerhard J. The Alcuin number of a graph and its connections to the vertex cover number. (English) Zbl 1235.90023 SIAM Rev. 54, No. 1, 141-154 (2012). MSC: 90B06 90B35 90C27 PDFBibTeX XMLCite \textit{P. Csorba} et al., SIAM Rev. 54, No. 1, 141--154 (2012; Zbl 1235.90023) Full Text: DOI Link
Brueggemann, Tobias; Hurink, Johann L.; Vredeveld, Tjark; Woeginger, Gerhard J. Exponential size neighborhoods for makespan minimization scheduling. (English) Zbl 1241.90043 Nav. Res. Logist. 58, No. 8, 795-803 (2011). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{T. Brueggemann} et al., Nav. Res. Logist. 58, No. 8, 795--803 (2011; Zbl 1241.90043) Full Text: DOI
Çela, Eranda; Schmuck, Nina S.; Wimer, Shmuel; Woeginger, Gerhard J. The Wiener maximum quadratic assignment problem. (English) Zbl 1233.90282 Discrete Optim. 8, No. 3, 411-416 (2011). MSC: 90C60 90B80 90C27 PDFBibTeX XMLCite \textit{E. Çela} et al., Discrete Optim. 8, No. 3, 411--416 (2011; Zbl 1233.90282) Full Text: DOI arXiv
Chrobak, Marek; Sgall, Jiří; Woeginger, Gerhard J. Two-bounded-space bin packing revisited. (English) Zbl 1346.68254 Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 263-274 (2011). MSC: 68W25 68Q17 68W27 90C27 PDFBibTeX XMLCite \textit{M. Chrobak} et al., Lect. Notes Comput. Sci. 6942, 263--274 (2011; Zbl 1346.68254) Full Text: DOI
Deineko, Vladimir G.; Woeginger, Gerhard J. A well-solvable special case of the bounded knapsack problem. (English) Zbl 1219.90137 Oper. Res. Lett. 39, No. 2, 118-120 (2011). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{V. G. Deineko} and \textit{G. J. Woeginger}, Oper. Res. Lett. 39, No. 2, 118--120 (2011; Zbl 1219.90137) Full Text: DOI
Günlük, Oktay (ed.); Woeginger, Gerhard J. (ed.) Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. (English) Zbl 1216.90002 Lecture Notes in Computer Science 6655. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). xiii, 432 p. (2011). MSC: 90-06 90C10 90C27 00B25 PDFBibTeX XMLCite \textit{O. Günlük} (ed.) and \textit{G. J. Woeginger} (ed.), Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15--17, 2011. Proceedings. Berlin: Springer (2011; Zbl 1216.90002) Full Text: DOI
Deineko, Vladimir G.; Woeginger, Gerhard J. Unbounded knapsack problems with arithmetic weight sequences. (English) Zbl 1215.90044 Eur. J. Oper. Res. 213, No. 2, 384-387 (2011). MSC: 90C27 90C39 90C60 PDFBibTeX XMLCite \textit{V. G. Deineko} and \textit{G. J. Woeginger}, Eur. J. Oper. Res. 213, No. 2, 384--387 (2011; Zbl 1215.90044) Full Text: DOI
Deineko, Vladimir G.; Woeginger, Gerhard J. Pinpointing the complexity of the interval min-max regret knapsack problem. (English) Zbl 1241.90178 Discrete Optim. 7, No. 4, 191-196 (2010). MSC: 90C47 90C27 90C60 PDFBibTeX XMLCite \textit{V. G. Deineko} and \textit{G. J. Woeginger}, Discrete Optim. 7, No. 4, 191--196 (2010; Zbl 1241.90178) Full Text: DOI
Csorba, Péter; Hurkens, Cor A. J.; Woeginger, Gerhard J. The Alcuin number of a graph and its connections to the vertex cover number. (English) Zbl 1229.90020 SIAM J. Discrete Math. 24, No. 3, 757-769 (2010). Reviewer: Erwin Pesch (Siegen) MSC: 90B06 90B35 90C27 05C70 PDFBibTeX XMLCite \textit{P. Csorba} et al., SIAM J. Discrete Math. 24, No. 3, 757--769 (2010; Zbl 1229.90020) Full Text: DOI Link
Deĭneko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. Polygons with inscribed circles and prescribed side lengths. (English) Zbl 1173.90509 Appl. Math. Lett. 22, No. 5, 704-706 (2009). MSC: 90C27 PDFBibTeX XMLCite \textit{V. G. Deĭneko} et al., Appl. Math. Lett. 22, No. 5, 704--706 (2009; Zbl 1173.90509) Full Text: DOI
Hulett, Heather; Will, Todd G.; Woeginger, Gerhard J. Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. (English) Zbl 1210.90140 Oper. Res. Lett. 36, No. 5, 594-596 (2008). MSC: 90C27 90C60 90C35 PDFBibTeX XMLCite \textit{H. Hulett} et al., Oper. Res. Lett. 36, No. 5, 594--596 (2008; Zbl 1210.90140) Full Text: DOI
Woeginger, Gerhard J. Open problems around exact algorithms. (English) Zbl 1165.90613 Discrete Appl. Math. 156, No. 3, 397-405 (2008). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Discrete Appl. Math. 156, No. 3, 397--405 (2008; Zbl 1165.90613) Full Text: DOI
Sgall, Jirí; Woeginger, Gerhard J. An approximation scheme for cake division with a linear number of cuts. (English) Zbl 1135.68645 Combinatorica 27, No. 2, 205-211 (2007). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{J. Sgall} and \textit{G. J. Woeginger}, Combinatorica 27, No. 2, 205--211 (2007; Zbl 1135.68645) Full Text: DOI
Pruhs, Kirk; Woeginger, Gerhard J. Approximation schemes for a class of subset selection problems. (English) Zbl 1119.90077 Theor. Comput. Sci. 382, No. 2, 151-156 (2007). MSC: 90C59 68W25 68R05 90B35 PDFBibTeX XMLCite \textit{K. Pruhs} and \textit{G. J. Woeginger}, Theor. Comput. Sci. 382, No. 2, 151--156 (2007; Zbl 1119.90077) Full Text: DOI Link
Alfieri, Arianna; Van De Velde, Steef; Woeginger, Gerhard J. Roll cutting in the curtain industry, or: a well-solvable allocation problem. (English) Zbl 1210.90071 Eur. J. Oper. Res. 183, No. 3, 1397-1404 (2007). MSC: 90B30 90C27 PDFBibTeX XMLCite \textit{A. Alfieri} et al., Eur. J. Oper. Res. 183, No. 3, 1397--1404 (2007; Zbl 1210.90071) Full Text: DOI
Deineko, Vladimir; Klinz, Bettina; Woeginger, Gerhard J. Four point conditions and exponential neighborhoods for symmetric TSP. (English) Zbl 1192.90165 Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 544-553 (2006). MSC: 90C27 68Q25 PDFBibTeX XMLCite \textit{V. Deineko} et al., in: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, Miami, FL, January 22--24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 544--553 (2006; Zbl 1192.90165) Full Text: DOI
Deĭneko, Vladimir G.; Woeginger, Gerhard J. Some problems around travelling salesmen, dart boards, and euro-coins. (English) Zbl 1169.90432 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 90, 43-52 (2006). MSC: 90C27 68Q25 90C35 PDFBibTeX XMLCite \textit{V. G. Deĭneko} and \textit{G. J. Woeginger}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 90, 43--52 (2006; Zbl 1169.90432)
Deĭneko, Vladimir G.; Woeginger, Gerhard J. Well-solvable instances for the partition problem. (English) Zbl 1278.90334 Appl. Math. Lett. 19, No. 10, 1053-1056 (2006). MSC: 90C27 90C60 68Q25 PDFBibTeX XMLCite \textit{V. G. Deĭneko} and \textit{G. J. Woeginger}, Appl. Math. Lett. 19, No. 10, 1053--1056 (2006; Zbl 1278.90334) Full Text: DOI
Deĭneko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. Exact algorithms for the Hamiltonian cycle problem in planar graphs. (English) Zbl 1089.05040 Oper. Res. Lett. 34, No. 3, 269-274 (2006). MSC: 05C45 90C27 05C38 05C85 90C35 PDFBibTeX XMLCite \textit{V. G. Deĭneko} et al., Oper. Res. Lett. 34, No. 3, 269--274 (2006; Zbl 1089.05040) Full Text: DOI
Levin, Asaf; Woeginger, Gerhard J. The constrained minimum weighted sum of job completion times problem. (English) Zbl 1098.90032 Math. Program. 108, No. 1 (A), 115-126 (2006). MSC: 90B35 90C27 68W25 PDFBibTeX XMLCite \textit{A. Levin} and \textit{G. J. Woeginger}, Math. Program. 108, No. 1 (A), 115--126 (2006; Zbl 1098.90032) Full Text: DOI
Deĭneko, Vladimir G.; Hoffmann, Michael; Okamoto, Yoshio; Woeginger, Gerhard J. The traveling salesman problem with few inner points. (English) Zbl 1080.90064 Oper. Res. Lett. 34, No. 1, 106-110 (2006). MSC: 90C27 PDFBibTeX XMLCite \textit{V. G. Deĭneko} et al., Oper. Res. Lett. 34, No. 1, 106--110 (2006; Zbl 1080.90064) Full Text: DOI
Cheng, T. C. Edwin; He, Yong; Hoogeveen, Han; Ji, Min; Woeginger, Gerhard J. Scheduling with step-improving processing times. (English) Zbl 1080.90044 Oper. Res. Lett. 34, No. 1, 37-40 (2006). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{T. C. E. Cheng} et al., Oper. Res. Lett. 34, No. 1, 37--40 (2006; Zbl 1080.90044) Full Text: DOI Link
Woeginger, Gerhard J. Combinatorial approximation algorithms: a comparative review. (English) Zbl 1213.00027 Oper. Res. Lett. 33, No. 2, 210-215 (2005). MSC: 00A17 90C59 68W25 68Q17 68Q25 90C60 90C27 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Oper. Res. Lett. 33, No. 2, 210--215 (2005; Zbl 1213.00027) Full Text: DOI
Chauhan, Satyaveer S.; Eremeev, Anton V.; Romanova, Anna A.; Servakh, Vladimir V.; Woeginger, Gerhard J. Approximation of the supply scheduling problem. (English) Zbl 1140.90392 Oper. Res. Lett. 33, No. 3, 249-254 (2005). MSC: 90B35 90C27 90C59 PDFBibTeX XMLCite \textit{S. S. Chauhan} et al., Oper. Res. Lett. 33, No. 3, 249--254 (2005; Zbl 1140.90392) Full Text: DOI
Seiden, Steven S.; Woeginger, Gerhard J. The two-dimensional cutting stock problem revisited. (English) Zbl 1078.90044 Math. Program. 102, No. 3 (A), 519-530 (2005). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90C27 90C59 52C15 PDFBibTeX XMLCite \textit{S. S. Seiden} and \textit{G. J. Woeginger}, Math. Program. 102, No. 3 (A), 519--530 (2005; Zbl 1078.90044) Full Text: DOI
Pruhs, Kirk; Woeginger, Gerhard J. Approximation schemes for a class of subset selection problems. (English) Zbl 1196.90106 Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 203-211 (2004). MSC: 90C27 68W25 90B35 90C59 PDFBibTeX XMLCite \textit{K. Pruhs} and \textit{G. J. Woeginger}, Lect. Notes Comput. Sci. 2976, 203--211 (2004; Zbl 1196.90106) Full Text: DOI
Deĭneko, Vladimir G.; Hoffmann, Michael; Okamoto, Yoshio; Woeginger, Gerhard J. The traveling salesman problem with few inner points. (English) Zbl 1091.90063 Chwa, Kyung-Yong (ed.) et al., Computing and combinatorics. 10th annual international conference, COCOON 2004, Jeju Island, Korea, August 17–20, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22856-X/pbk). Lecture Notes in Computer Science 3106, 268-277 (2004). MSC: 90C27 90C35 90C60 PDFBibTeX XMLCite \textit{V. G. Deĭneko} et al., Lect. Notes Comput. Sci. 3106, 268--277 (2004; Zbl 1091.90063) Full Text: DOI
Hurkens, Cor A. J.; Woeginger, Gerhard J. On the nearest neighbor rule for the traveling salesman problem. (English) Zbl 1056.90117 Oper. Res. Lett. 32, No. 1, 1-4 (2004). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{C. A. J. Hurkens} and \textit{G. J. Woeginger}, Oper. Res. Lett. 32, No. 1, 1--4 (2004; Zbl 1056.90117) Full Text: DOI
Barvinok, Alexander; Fekete, Sándor P.; Johnson, David S.; Tamir, Arie; Woeginger, Gerhard J.; Woodroofe, Russ The geometric maximum traveling salesman problem. (English) Zbl 1325.90074 J. ACM 50, No. 5, 641-664 (2003). MSC: 90C27 68Q17 68Q25 90C35 PDFBibTeX XMLCite \textit{A. Barvinok} et al., J. ACM 50, No. 5, 641--664 (2003; Zbl 1325.90074) Full Text: DOI arXiv
Woeginger, Gerhard J. Computational problems without computation. (English) Zbl 1151.90621 Nieuw Arch. Wiskd. (5) 4, No. 2, 140-147 (2003). MSC: 90C90 90C27 90-01 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Nieuw Arch. Wiskd. (5) 4, No. 2, 140--147 (2003; Zbl 1151.90621)
Deĭneko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. Which matrices are immune against the transportation paradox? (English) Zbl 1033.90008 Discrete Appl. Math. 130, No. 3, 495-501 (2003). MSC: 90B06 90C27 PDFBibTeX XMLCite \textit{V. G. Deĭneko} et al., Discrete Appl. Math. 130, No. 3, 495--501 (2003; Zbl 1033.90008) Full Text: DOI
Deĭneko, Vladimir G.; Woeginger, Gerhard J. Complexity and approximability results for slicing floorplan designs. (English) Zbl 1033.90101 Eur. J. Oper. Res. 149, No. 3, 533-539 (2003). MSC: 90C27 65Y20 90C59 PDFBibTeX XMLCite \textit{V. G. Deĭneko} and \textit{G. J. Woeginger}, Eur. J. Oper. Res. 149, No. 3, 533--539 (2003; Zbl 1033.90101) Full Text: DOI
Woeginger, Gerhard J. Exact algorithms for NP-hard problems: A survey. (English) Zbl 1024.68529 Jünger, Michael (ed.) et al., Combinatorial optimization - Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5-9, 2001. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2570, 185-207 (2003). MSC: 68Q17 90C27 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Lect. Notes Comput. Sci. 2570, 185--207 (2003; Zbl 1024.68529) Full Text: Link
Brüggemann, Tobias; Monnot, Jérôme; Woeginger, Gerhard J. Local search for the minimum label spanning tree problem with bounded color classes. (English) Zbl 1046.90070 Oper. Res. Lett. 31, No. 3, 195-201 (2003). MSC: 90C27 90C59 90C40 05C85 PDFBibTeX XMLCite \textit{T. Brüggemann} et al., Oper. Res. Lett. 31, No. 3, 195--201 (2003; Zbl 1046.90070) Full Text: DOI
Rinaldi, Giovanni; Voigt, Ulrich; Woeginger, Gerhard J. The mathematics of playing golf. (English) Zbl 1178.90295 Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 265-266 (2002). MSC: 90C27 90C30 PDFBibTeX XMLCite \textit{G. Rinaldi} et al., in: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2002, San Francisco, CA, USA, January 6--8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 265--266 (2002; Zbl 1178.90295)
Rader, David J. jun.; Woeginger, Gerhard J. The quadratic 0-1 knapsack problem with series-parallel support. (English) Zbl 1010.90067 Oper. Res. Lett. 30, No. 3, 159-166 (2002). MSC: 90C27 90C39 90C59 65Y20 PDFBibTeX XMLCite \textit{D. J. Rader jun.} and \textit{G. J. Woeginger}, Oper. Res. Lett. 30, No. 3, 159--166 (2002; Zbl 1010.90067) Full Text: DOI
Rinaldi, Giovanni; Voigt, Ulrich; Woeginger, Gerhard J. The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs. (English) Zbl 1010.90066 Math. Program. 93, No. 1 (A), 77-86 (2002). MSC: 90C27 90C30 PDFBibTeX XMLCite \textit{G. Rinaldi} et al., Math. Program. 93, No. 1 (A), 77--86 (2002; Zbl 1010.90066) Full Text: DOI
Woeginger, Gerhard J. An efficient algorithm for a class of constraint satisfaction problems. (English) Zbl 1030.90112 Oper. Res. Lett. 30, No. 1, 9-16 (2002). MSC: 90C27 68Q25 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Oper. Res. Lett. 30, No. 1, 9--16 (2002; Zbl 1030.90112) Full Text: DOI
Zukerman, Moshe; Jia, Long; Neame, Timothy; Woeginger, Gerhard J. A polynomially solvable special case of the unbounded knapsack problem. (English) Zbl 0981.90062 Oper. Res. Lett. 29, No. 1, 13-16 (2001). MSC: 90C57 90C10 65Y20 PDFBibTeX XMLCite \textit{M. Zukerman} et al., Oper. Res. Lett. 29, No. 1, 13--16 (2001; Zbl 0981.90062) Full Text: DOI
Deǐneko, Vladimir G.; Woeginger, Gerhard J. A comment on consecutive-2-out-of-\(n\) systems. (English) Zbl 0992.90017 Oper. Res. Lett. 28, No. 4, 169-171 (2001). MSC: 90B25 90C35 PDFBibTeX XMLCite \textit{V. G. Deǐneko} and \textit{G. J. Woeginger}, Oper. Res. Lett. 28, No. 4, 169--171 (2001; Zbl 0992.90017) Full Text: DOI
Hoogeveen, Han; Potts, Chris N.; Woeginger, Gerhard J. On-line scheduling on a single machine: Maximizing the number of early jobs. (English) Zbl 0991.90071 Oper. Res. Lett. 27, No. 5, 193-197 (2001). MSC: 90B35 68Q25 90C27 PDFBibTeX XMLCite \textit{H. Hoogeveen} et al., Oper. Res. Lett. 27, No. 5, 193--197 (2001; Zbl 0991.90071) Full Text: DOI
Woeginger, Gerhard J. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? (English) Zbl 1034.90014 INFORMS J. Comput. 12, No. 1, 57-74 (2000). MSC: 90C39 90C27 PDFBibTeX XMLCite \textit{G. J. Woeginger}, INFORMS J. Comput. 12, No. 1, 57--74 (2000; Zbl 1034.90014) Full Text: DOI
Csirik, János; Woeginger, Gerhard J. Resource augmentation for online bounded space bin packing. (Extended abstract). (English) Zbl 0973.68529 Montanari, Ugo (ed.) et al., Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1853, 296-304 (2000). MSC: 68Q25 90C27 PDFBibTeX XMLCite \textit{J. Csirik} and \textit{G. J. Woeginger}, Lect. Notes Comput. Sci. 1853, 296--304 (2000; Zbl 0973.68529)
Deĭneko, Vladimir G.; Woeginger, Gerhard J. A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. (English) Zbl 1043.90075 Math. Program. 87, No. 3 (A), 519-542 (2000). MSC: 90C27 90C35 90C60 68Q25 PDFBibTeX XMLCite \textit{V. G. Deĭneko} and \textit{G. J. Woeginger}, Math. Program. 87, No. 3 (A), 519--542 (2000; Zbl 1043.90075) Full Text: DOI
Deĭneko, Vladimir G.; Woeginger, Gerhard J. The maximum travelling salesman problem on symmetric Demidenko matrices. (English) Zbl 0945.90048 Discrete Appl. Math. 99, No. 1-3, 413-425 (2000). MSC: 90C27 PDFBibTeX XMLCite \textit{V. G. Deĭneko} and \textit{G. J. Woeginger}, Discrete Appl. Math. 99, No. 1--3, 413--425 (2000; Zbl 0945.90048) Full Text: DOI
Woeginger, Gerhard J. An approximation scheme for minimizing agreeably weighted variance on a single machine. (English) Zbl 1040.90527 INFORMS J. Comput. 11, No. 2, 211-216 (1999). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{G. J. Woeginger}, INFORMS J. Comput. 11, No. 2, 211--216 (1999; Zbl 1040.90527) Full Text: DOI
Burkard, Rainer E.; Feldbacher, Karin; Klinz, Bettina; Woeginger, Gerhard J. Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. (English) Zbl 1002.90079 Networks 33, No. 1, 57-70 (1999). MSC: 90C35 05C20 90C27 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., Networks 33, No. 1, 57--70 (1999; Zbl 1002.90079) Full Text: DOI
Woeginger, Gerhard J. Sensitivity analysis for knapsack problems: Another negative result. (English) Zbl 0957.90124 Discrete Appl. Math. 92, No. 2-3, 247-251 (1999). MSC: 90C31 90C27 68Q25 90C60 PDFBibTeX XMLCite \textit{G. J. Woeginger}, Discrete Appl. Math. 92, No. 2--3, 247--251 (1999; Zbl 0957.90124) 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
Woeginger, Gerhard J. When does a dynamic programming formulation guarantee the existence of an FPTAS? (English) Zbl 0929.65034 Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17–19, 1999. Philadelphia, PA: SIAM. 820-829 (1999). MSC: 65K05 90B35 90C27 90C39 PDFBibTeX XMLCite \textit{G. J. Woeginger}, in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 820--829 (1999; Zbl 0929.65034)
Cornuéjols, Gérard (ed.); Burkard, Rainer E. (ed.); Woeginger, Gerhard J. (ed.) Integer programming and combinatorial optimization. 7th international IPCO conference, Graz, Austria, June 9–11, 1999. Proceedings. (English) Zbl 0914.00106 Lecture Notes in Computer Science. 1610. Berlin: Springer. ix, 453 p. DM 102.00; öS 745.00; sFr 93.00; £39.00; $ 58.30 (1999). MSC: 00B25 90-06 90C10 90C27 PDFBibTeX XMLCite \textit{G. Cornuéjols} (ed.) et al., Integer programming and combinatorial optimization. 7th international IPCO conference, Graz, Austria, June 9--11, 1999. Proceedings. Berlin: Springer (1999; Zbl 0914.00106)
Burkard, Rainer E.; Deĭneko, Vladimir G.; Woeginger, Gerhard J. The travelling salesman problem on permuted Monge matrices. (English) Zbl 0955.90113 J. Comb. Optim. 2, No. 4, 333-350 (1999). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., J. Comb. Optim. 2, No. 4, 333--350 (1999; Zbl 0955.90113) Full Text: DOI
Chen, Bo; Potts, Chris N.; Woeginger, Gerhard J. A review of machine scheduling: Complexity, algorithms and approximability. (English) Zbl 0944.90022 Du, Ding-Zhu (ed.) et al., Handbook of combinatorial optimization. Vol. 3. Boston: Kluwer Academic Publishers. 21-169 (1998). Reviewer: M.Kubale (Gdańsk) MSC: 90B35 90-02 90C27 68W25 PDFBibTeX XMLCite \textit{B. Chen} et al., in: Handbook of combinatorial optimization. Vol. 3. Boston: Kluwer Academic Publishers. 21--169 (1998; Zbl 0944.90022)
Burkard, Rainer E.; Çela, Eranda; Rote, Günter; Woeginger, Gerhard J. The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. (English) Zbl 0949.90077 Math. Program. 82, No. 1-2 (B), 125-158 (1998). MSC: 90C27 90C20 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., Math. Program. 82, No. 1--2 (B), 125--158 (1998; Zbl 0949.90077) Full Text: DOI
Burkard, Rainer E.; Çela, Eranda; Demidenko, Vitaly M.; Metelski, Nikolai N.; Woeginger, Gerhard J. A unified approach to simple special cases of extremal permutation problems. (English) Zbl 0916.90225 Optimization 44, No. 2, 123-138 (1998). MSC: 90C27 90B80 68Q25 90C60 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., Optimization 44, No. 2, 123--138 (1998; Zbl 0916.90225) Full Text: DOI
Alon, Noga; Azar, Yossi; Woeginger, Gerhard J.; Yadid, Tal Approximation schemes for scheduling on parallel machines. (English) Zbl 0909.90168 J. Sched. 1, No. 1, 55-66 (1998). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Sched. 1, No. 1, 55--66 (1998; Zbl 0909.90168) Full Text: DOI
Deĭneko, Vladimir; Woeginger, Gerhard J. A solvable case of the quadratic assignment problem. (English) Zbl 0910.90226 Oper. Res. Lett. 22, No. 1, 13-17 (1998). MSC: 90C20 90C27 90B80 PDFBibTeX XMLCite \textit{V. Deĭneko} and \textit{G. J. Woeginger}, Oper. Res. Lett. 22, No. 1, 13--17 (1998; Zbl 0910.90226) Full Text: DOI
Burkard, Rainer E.; Deineko, Vladimir G.; van Dal, René; van der Veen, Jack A. A.; Woeginger, Gerhard J. Well-solvable special cases of the traveling salesman problem: a survey. (English) Zbl 1052.90597 SIAM Rev. 40, No. 3, 496-546 (1998). MSC: 90C27 90C35 68Q25 05C65 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., SIAM Rev. 40, No. 3, 496--546 (1998; Zbl 1052.90597) Full Text: DOI Link
Deĭneko, Vladimir G.; Rudolf, Rüdiger; Woeginger, Gerhard J. Sometimes travelling is easy: the master tour problem. (English) Zbl 0914.90253 SIAM J. Discrete Math. 11, No. 1, 81-93 (1998). MSC: 90C35 90C27 05C38 68R10 05C85 68W10 PDFBibTeX XMLCite \textit{V. G. Deĭneko} et al., SIAM J. Discrete Math. 11, No. 1, 81--93 (1998; Zbl 0914.90253) Full Text: DOI
Csirik, János; Woeginger, Gerhard J. Shelf algorithms for on-line strip packing. (English) Zbl 1336.68305 Inf. Process. Lett. 63, No. 4, 171-175 (1997). MSC: 68W27 68Q25 90C27 PDFBibTeX XMLCite \textit{J. Csirik} and \textit{G. J. Woeginger}, Inf. Process. Lett. 63, No. 4, 171--175 (1997; Zbl 1336.68305) Full Text: DOI
Fekete, Sándor P.; Woeginger, Gerhard J. Angle-restricted tours in the plane. (English) Zbl 1133.90385 Comput. Geom. 8, No. 4, 195-218 (1997). MSC: 90C27 05C45 68R10 68U05 PDFBibTeX XMLCite \textit{S. P. Fekete} and \textit{G. J. Woeginger}, Comput. Geom. 8, No. 4, 195--218 (1997; Zbl 1133.90385) Full Text: DOI
Deǐneko, V. G.; van der Veen, J. A.; Rudolf, Rüdiger; Woeginger, Gerhard J. Three easy special cases of the Euclidean travelling salesman problem. (English) Zbl 0888.90141 RAIRO, Rech. Opér. 31, No. 4, 343-362 (1997). MSC: 90C35 90C60 90C27 PDFBibTeX XMLCite \textit{V. G. Deǐneko} et al., RAIRO, Rech. Opér. 31, No. 4, 343--362 (1997; Zbl 0888.90141) Full Text: DOI EuDML
Deĭneko, Vladimir G.; Woeginger, Gerhard J. The Convex-hull-and-k-line Travelling Salesman Problem. (English) Zbl 0900.68326 Inf. Process. Lett. 59, No. 6, 295-301 (1996). MSC: 68R05 PDFBibTeX XMLCite \textit{V. G. Deĭneko} and \textit{G. J. Woeginger}, Inf. Process. Lett. 59, No. 6, 295--301 (1996; Zbl 0900.68326) Full Text: DOI
Burkard, Rainer E.; Rudolf, Rüdiger; Woeginger, Gerhard J. Three-dimensional axial assignment problems with decomposable cost coefficients. (English) Zbl 0846.90090 Discrete Appl. Math. 65, No. 1-3, 123-139 (1996). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., Discrete Appl. Math. 65, No. 1--3, 123--139 (1996; Zbl 0846.90090) Full Text: DOI
Burkard, Rainer E.; Deineko, Vladimir G.; Woeginger, Gerhard J. The travelling salesman and the PQ-tree. (English) Zbl 1415.90060 Cunningham, W. H. (ed.) et al., Integer programming and combinatorial optimization. 5th international IPCO conference, Vancouver, Canada, June 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1084, 490-504 (1996). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., Lect. Notes Comput. Sci. 1084, 490--504 (1996; Zbl 1415.90060) Full Text: DOI
Burkard, Rainer E.; Çela, Eranda; Rote, Günther; Woeginger, Gerhard J. The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases. (English) Zbl 1414.90192 Cunningham, W. H. (ed.) et al., Integer programming and combinatorial optimization. 5th international IPCO conference, Vancouver, Canada, June 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1084, 204-218 (1996). MSC: 90B80 90C27 PDFBibTeX XMLCite \textit{R. E. Burkard} et al., Lect. Notes Comput. Sci. 1084, 204--218 (1996; Zbl 1414.90192) Full Text: DOI