Bucarey, Víctor; Fortz, Bernard; González-Blanco, Natividad; Labbé, Martine; Mesa, Juan A. Benders decomposition for network design covering problems. (English) Zbl 1511.90096 Comput. Oper. Res. 137, Article ID 105417, 15 p. (2022). MSC: 90B10 90C11 90C35 PDFBibTeX XMLCite \textit{V. Bucarey} et al., Comput. Oper. Res. 137, Article ID 105417, 15 p. (2022; Zbl 1511.90096) Full Text: DOI arXiv
Alfandari, Laurent; Ljubić, Ivana; De Melo da Silva, Marcos A tailored Benders decomposition approach for last-mile delivery with autonomous robots. (English) Zbl 1490.90033 Eur. J. Oper. Res. 299, No. 2, 510-525 (2022). MSC: 90B06 90B80 90C11 PDFBibTeX XMLCite \textit{L. Alfandari} et al., Eur. J. Oper. Res. 299, No. 2, 510--525 (2022; Zbl 1490.90033) Full Text: DOI
Gruson, Matthieu; Cordeau, Jean-François; Jans, Raf Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure. (English) Zbl 1487.90023 Eur. J. Oper. Res. 291, No. 1, 206-217 (2021). MSC: 90B05 90B30 90C15 PDFBibTeX XMLCite \textit{M. Gruson} et al., Eur. J. Oper. Res. 291, No. 1, 206--217 (2021; Zbl 1487.90023) Full Text: DOI
Şuvak, Zeynep; Altınel, İ. Kuban; Aras, Necati Exact solution algorithms for the maximum flow problem with additional conflict constraints. (English) Zbl 1487.90629 Eur. J. Oper. Res. 287, No. 2, 410-437 (2020). MSC: 90C35 90C27 90C57 PDFBibTeX XMLCite \textit{Z. Şuvak} et al., Eur. J. Oper. Res. 287, No. 2, 410--437 (2020; Zbl 1487.90629) Full Text: DOI
Álvarez-Miranda, Eduardo; Sinnl, Markus Mixed-integer programming approaches for the tree \(t^*\)-spanner problem. (English) Zbl 1430.90474 Optim. Lett. 13, No. 7, 1693-1709 (2019). MSC: 90C27 90C11 90C57 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} and \textit{M. Sinnl}, Optim. Lett. 13, No. 7, 1693--1709 (2019; Zbl 1430.90474) Full Text: DOI
Zetina, Carlos Armando; Contreras, Ivan; Cordeau, Jean-François Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design. (English) Zbl 1458.90180 Comput. Oper. Res. 111, 311-324 (2019). MSC: 90B10 90C35 90C57 90C59 PDFBibTeX XMLCite \textit{C. A. Zetina} et al., Comput. Oper. Res. 111, 311--324 (2019; Zbl 1458.90180) Full Text: DOI
Zetina, Carlos Armando; Contreras, Ivan; Fernández, Elena; Luna-Mota, Carlos Solving the optimum communication spanning tree problem. (English) Zbl 1403.90214 Eur. J. Oper. Res. 273, No. 1, 108-117 (2019). MSC: 90B10 90C35 90B18 90C57 PDFBibTeX XMLCite \textit{C. A. Zetina} et al., Eur. J. Oper. Res. 273, No. 1, 108--117 (2019; Zbl 1403.90214) Full Text: DOI Link
Pearce, Robin H.; Forbes, Michael Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem. (English) Zbl 1403.90485 Eur. J. Oper. Res. 270, No. 1, 78-88 (2018). MSC: 90B80 90B10 90C57 PDFBibTeX XMLCite \textit{R. H. Pearce} and \textit{M. Forbes}, Eur. J. Oper. Res. 270, No. 1, 78--88 (2018; Zbl 1403.90485) Full Text: DOI arXiv
de Camargo, Ricardo S.; de Miranda, Gilberto; O’Kelly, Morton E.; Campbell, James F. Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints. (English) Zbl 1480.90162 Appl. Math. Modelling 51, 274-301 (2017). MSC: 90B80 90B10 PDFBibTeX XMLCite \textit{R. S. de Camargo} et al., Appl. Math. Modelling 51, 274--301 (2017; Zbl 1480.90162) Full Text: DOI
Rahmaniani, Ragheb; Crainic, Teodor Gabriel; Gendreau, Michel; Rei, Walter The Benders decomposition algorithm: a literature review. (English) Zbl 1402.90158 Eur. J. Oper. Res. 259, No. 3, 801-817 (2017). MSC: 90C27 90C57 90C59 90-02 PDFBibTeX XMLCite \textit{R. Rahmaniani} et al., Eur. J. Oper. Res. 259, No. 3, 801--817 (2017; Zbl 1402.90158) Full Text: DOI
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus Solving minimum-cost shared arborescence problems. (English) Zbl 1394.90429 Eur. J. Oper. Res. 258, No. 3, 887-901 (2017). MSC: 90C10 90C35 90B10 90C11 90C57 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} et al., Eur. J. Oper. Res. 258, No. 3, 887--901 (2017; Zbl 1394.90429) Full Text: DOI
Haddadi, S. Benders decomposition for set covering problems. Almost satisfying the consecutive ones property. (English) Zbl 1364.90290 J. Comb. Optim. 33, No. 1, 60-80 (2017). MSC: 90C27 90C11 90C90 PDFBibTeX XMLCite \textit{S. Haddadi}, J. Comb. Optim. 33, No. 1, 60--80 (2017; Zbl 1364.90290) Full Text: DOI
Raidl, Günther R. Decomposition based hybrid metaheuristics. (English) Zbl 1346.90827 Eur. J. Oper. Res. 244, No. 1, 66-76 (2015). MSC: 90C59 90C27 90C11 PDFBibTeX XMLCite \textit{G. R. Raidl}, Eur. J. Oper. Res. 244, No. 1, 66--76 (2015; Zbl 1346.90827) Full Text: DOI
Oliveira, F.; Grossmann, I. E.; Hamacher, S. Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain. (English) Zbl 1349.90115 Comput. Oper. Res. 49, 47-58 (2014). MSC: 90B06 90C15 PDFBibTeX XMLCite \textit{F. Oliveira} et al., Comput. Oper. Res. 49, 47--58 (2014; Zbl 1349.90115) Full Text: DOI
Lee, Chungmok; Lee, Kyungsik; Park, Sungsoo Benders decomposition approach for the robust network design problem with flow bifurcations. (English) Zbl 1269.90019 Networks 62, No. 1, 1-16 (2013). MSC: 90B10 68M10 05C90 90C10 PDFBibTeX XMLCite \textit{C. Lee} et al., Networks 62, No. 1, 1--16 (2013; Zbl 1269.90019) Full Text: DOI
Ljubić, Ivana; Putz, Peter; Salazar-González, Juan-José Exact approaches to the single-source network loading problem. (English) Zbl 1241.90018 Networks 59, No. 1, 89-106 (2012). MSC: 90B10 90C11 PDFBibTeX XMLCite \textit{I. Ljubić} et al., Networks 59, No. 1, 89--106 (2012; Zbl 1241.90018) Full Text: DOI
Miranda, G.; Luna, H. P.; De Camargo, R. S.; Pinto, L. R. Tree network design avoiding congestion. (English) Zbl 1225.90015 Appl. Math. Modelling 35, No. 9, 4175-4188 (2011). MSC: 90B10 05C82 90C35 90C11 PDFBibTeX XMLCite \textit{G. Miranda} et al., Appl. Math. Modelling 35, No. 9, 4175--4188 (2011; Zbl 1225.90015) Full Text: DOI
Üster, Halit; Agrahari, Homarjun A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations. (English) Zbl 1218.90051 Oper. Res. Lett. 39, No. 2, 138-143 (2011). MSC: 90B10 90B06 PDFBibTeX XMLCite \textit{H. Üster} and \textit{H. Agrahari}, Oper. Res. Lett. 39, No. 2, 138--143 (2011; Zbl 1218.90051) Full Text: DOI
Katayama, N.; Chen, Ming Zhe; Kubo, Mikio A capacity scaling heuristic for the multicommodity capacitated network design problem. (English) Zbl 1178.90057 J. Comput. Appl. Math. 232, No. 1, 90-101 (2009). Reviewer: Tiit Riismaa (Tallinn) MSC: 90B10 90C35 94C30 90C59 PDFBibTeX XMLCite \textit{N. Katayama} et al., J. Comput. Appl. Math. 232, No. 1, 90--101 (2009; Zbl 1178.90057) Full Text: DOI
de Camargo, R. S.; Miranda, G. jun.; Ferreira, R. P. M.; Luna, H. P. Multiple allocation hub-and-spoke network design under hub congestion. (English) Zbl 1177.90064 Comput. Oper. Res. 36, No. 12, 3097-3106 (2009). MSC: 90B10 90C06 90C11 PDFBibTeX XMLCite \textit{R. S. de Camargo} et al., Comput. Oper. Res. 36, No. 12, 3097--3106 (2009; Zbl 1177.90064) Full Text: DOI
de Camargo, R. S.; Miranda jun., G.; Luna, H. P. Benders decomposition for the uncapacitated multiple allocation hub location problem. (English) Zbl 1180.90038 Comput. Oper. Res. 35, No. 4, 1047-1064 (2008). MSC: 90B10 PDFBibTeX XMLCite \textit{R. S. de Camargo} et al., Comput. Oper. Res. 35, No. 4, 1047--1064 (2008; Zbl 1180.90038) Full Text: DOI
Rodríguez-Martín, Inmaculada; Salazar-González, Juan José Solving a capacitated hub location problem. (English) Zbl 1149.90317 Eur. J. Oper. Res. 184, No. 2, 468-479 (2008). MSC: 90B18 90B80 90C57 PDFBibTeX XMLCite \textit{I. Rodríguez-Martín} and \textit{J. J. Salazar-González}, Eur. J. Oper. Res. 184, No. 2, 468--479 (2008; Zbl 1149.90317) Full Text: DOI
Thomadsen, Tommy; Stidsen, Thomas The generalized fixed-charge network design problem. (English) Zbl 1102.90012 Comput. Oper. Res. 34, No. 4, 997-1007 (2007). MSC: 90B10 90B18 90C11 90C57 PDFBibTeX XMLCite \textit{T. Thomadsen} and \textit{T. Stidsen}, Comput. Oper. Res. 34, No. 4, 997--1007 (2007; Zbl 1102.90012) Full Text: DOI
Kim, Dukwon; Pan, Xinyan; Pardalos, Panos M. An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems. (English) Zbl 1122.90014 Comput. Econ. 27, No. 2-3, 273-293 (2006). MSC: 90B10 90B40 90C59 PDFBibTeX XMLCite \textit{D. Kim} et al., Comput. Econ. 27, No. 2--3, 273--293 (2006; Zbl 1122.90014) Full Text: DOI
Montemanni, Roberto A Benders decomposition approach for the robust spanning tree problem with interval data. (English) Zbl 1102.90050 Eur. J. Oper. Res. 174, No. 3, 1479-1490 (2006). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{R. Montemanni}, Eur. J. Oper. Res. 174, No. 3, 1479--1490 (2006; Zbl 1102.90050) Full Text: DOI
Glover, Fred; Sherali, Hanif D. Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints. (English) Zbl 1091.90049 Ann. Oper. Res. 140, 215-233 (2005). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{F. Glover} and \textit{H. D. Sherali}, Ann. Oper. Res. 140, 215--233 (2005; Zbl 1091.90049) Full Text: DOI
Alvarez, Ada M.; González-Velarde, José Luis; De-Alba, Karim Scatter search for network design problem. (English) Zbl 1091.90006 Ann. Oper. Res. 138, 159-178 (2005). MSC: 90B10 90C59 PDFBibTeX XMLCite \textit{A. M. Alvarez} et al., Ann. Oper. Res. 138, 159--178 (2005; Zbl 1091.90006) Full Text: DOI
Alvarez, Ada M.; González-Velarde, José Luis; De-Alba, Karim Memetic algorithms. (English) Zbl 1122.90415 J. Heuristics 11, No. 3, 233-257 (2005). MSC: 90C35 90C59 68T20 PDFBibTeX XMLCite \textit{A. M. Alvarez} et al., J. Heuristics 11, No. 3, 233--257 (2005; Zbl 1122.90415) Full Text: DOI
Costa, Alysson M. A survey on Benders decomposition applied to fixed-charge network design problems. (English) Zbl 1071.90009 Comput. Oper. Res. 32, No. 6, 1429-1450 (2004). MSC: 90B10 PDFBibTeX XMLCite \textit{A. M. Costa}, Comput. Oper. Res. 32, No. 6, 1429--1450 (2004; Zbl 1071.90009) Full Text: DOI
Holmberg, Kaj; Yuan, Di Optimization of internet protocol network design and routing. (English) Zbl 1143.90392 Networks 43, No. 1, 39-53 (2004). MSC: 90C35 68M12 90C90 PDFBibTeX XMLCite \textit{K. Holmberg} and \textit{D. Yuan}, Networks 43, No. 1, 39--53 (2004; Zbl 1143.90392) Full Text: DOI
Sridhar, Varadharajan; Park, June S. Benders-and-cut algorithm for fixed-charge capacitated network design problem. (English) Zbl 0967.90011 Eur. J. Oper. Res. 125, No. 3, 622-632 (2000). MSC: 90B10 90C57 49M27 90C10 PDFBibTeX XMLCite \textit{V. Sridhar} and \textit{J. S. Park}, Eur. J. Oper. Res. 125, No. 3, 622--632 (2000; Zbl 0967.90011) Full Text: DOI
Gabrel, V.; Knippel, A.; Minoux, M. Exact solution of multicommodity network optimization problems with general step cost functions. (English) Zbl 0967.90012 Oper. Res. Lett. 25, No. 1, 15-23 (1999). MSC: 90B15 49M27 PDFBibTeX XMLCite \textit{V. Gabrel} et al., Oper. Res. Lett. 25, No. 1, 15--23 (1999; Zbl 0967.90012) Full Text: DOI
Cruz, F. R. B.; MacGregor Smith, J.; Mateus, G. R. Solving to optimality the uncapacitated fixed-charge network flow problem. (English) Zbl 0907.90132 Comput. Oper. Res. 25, No. 1, 67-81 (1998). MSC: 90B10 PDFBibTeX XMLCite \textit{F. R. B. Cruz} et al., Comput. Oper. Res. 25, No. 1, 67--81 (1998; Zbl 0907.90132) Full Text: DOI
Gutiérrez, Genaro J.; Kouvelis, Panagiotis; Kurawarwala, Abbas A. A robustness approach to uncapacitated network design problems. (English) Zbl 0953.90503 Eur. J. Oper. Res. 94, No. 2, 362-376 (1996). MSC: 90B10 PDFBibTeX XMLCite \textit{G. J. Gutiérrez} et al., Eur. J. Oper. Res. 94, No. 2, 362--376 (1996; Zbl 0953.90503) Full Text: DOI
Bertsimas, Dimitris; Orlin, James B. A technique for speeding up the solution of the Lagrangean dual. (English) Zbl 0806.90081 Math. Program. 63, No. 1 (A), 23-45 (1994). MSC: 90C05 90C60 90C27 PDFBibTeX XMLCite \textit{D. Bertsimas} and \textit{J. B. Orlin}, Math. Program. 63, No. 1 (A), 23--45 (1994; Zbl 0806.90081) Full Text: DOI
Thach, Phan Thien A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure. (English) Zbl 0763.90041 Math. Program., Ser. A 53, No. 3, 339-359 (1992). MSC: 90B10 49J52 90C35 90-08 49M27 PDFBibTeX XMLCite \textit{P. T. Thach}, Math. Program. 53, No. 3 (A), 339--359 (1992; Zbl 0763.90041) Full Text: DOI
Phan Thien Thach A decomposition method for the min concave cost flow problem with a staircase structure. (English) Zbl 0695.90042 Japan J. Appl. Math. 7, No. 1, 103-120 (1990). Reviewer: J.Kamburowski MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{Phan Thien Thach}, Japan J. Appl. Math. 7, No. 1, 103--120 (1990; Zbl 0695.90042) Full Text: DOI
Hochbaum, Dorit S.; Segev, Arie Analysis of a flow problem with fixed charges. (English) Zbl 0673.90035 Networks 19, No. 3, 291-312 (1989). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{A. Segev}, Networks 19, No. 3, 291--312 (1989; Zbl 0673.90035) Full Text: DOI
Balakrishnan, Anantaram LP extreme points and cuts for the fixed-charge network design problem. (English) Zbl 0637.90095 Math. Program. 39, 263-284 (1987). MSC: 90C35 PDFBibTeX XMLCite \textit{A. Balakrishnan}, Math. Program. 39, 263--284 (1987; Zbl 0637.90095) Full Text: DOI