Carvalho, Desiree M.; Nascimento, Mariá C. V. Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup. (English) Zbl 1487.90012 Eur. J. Oper. Res. 296, No. 1, 158-173 (2022). MSC: 90B05 90B35 90B30 90C59 PDFBibTeX XMLCite \textit{D. M. Carvalho} and \textit{M. C. V. Nascimento}, Eur. J. Oper. Res. 296, No. 1, 158--173 (2022; Zbl 1487.90012) Full Text: DOI arXiv
Meyr, Herbert; Mann, Matthias A decomposition approach for the general lotsizing and scheduling problem for parallel production lines. (English) Zbl 1317.90128 Eur. J. Oper. Res. 229, No. 3, 718-731 (2013). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{H. Meyr} and \textit{M. Mann}, Eur. J. Oper. Res. 229, No. 3, 718--731 (2013; Zbl 1317.90128) Full Text: DOI
Gopalakrishnan, Balaji; Kong, Seunghyun; Barnes, Earl; Johnson, Ellis L.; Sokol, Joel S. A least-squares minimum-cost network flow algorithm. (English) Zbl 1225.90014 Ann. Oper. Res. 186, 119-140 (2011). MSC: 90B10 90C20 PDFBibTeX XMLCite \textit{B. Gopalakrishnan} et al., Ann. Oper. Res. 186, 119--140 (2011; Zbl 1225.90014) Full Text: DOI
Zhu, Xiaoyan; Yuan, Qi; Garcia-Diaz, Alberto; Dong, Liang Minimal-cost network flow problems with variable lower bounds on arc flows. (English) Zbl 1208.90031 Comput. Oper. Res. 38, No. 8, 1210-1218 (2011). MSC: 90B10 90C35 90C11 PDFBibTeX XMLCite \textit{X. Zhu} et al., Comput. Oper. Res. 38, No. 8, 1210--1218 (2011; Zbl 1208.90031) Full Text: DOI
Miller-Hooks, Elise; Tang, Hao; Chen, Zhiying Updating network flows given multiple, heterogeneous arc attribute changes. (English) Zbl 1229.90030 J. Math. Model. Algorithms 9, No. 4, 291-309 (2010). MSC: 90B10 05C90 PDFBibTeX XMLCite \textit{E. Miller-Hooks} et al., J. Math. Model. Algorithms 9, No. 4, 291--309 (2010; Zbl 1229.90030) Full Text: DOI
Restrepo, Mateo; Williamson, David P. A simple GAP-canceling algorithm for the generalized maximum flow problem. (English) Zbl 1169.90319 Math. Program. 118, No. 1 (A), 47-74 (2009). MSC: 90B10 68Q25 90C35 05C85 PDFBibTeX XMLCite \textit{M. Restrepo} and \textit{D. P. Williamson}, Math. Program. 118, No. 1 (A), 47--74 (2009; Zbl 1169.90319) Full Text: DOI
Batenburg, K. J. Network flow algorithms for discrete tomography. (English) Zbl 1175.90055 Herman, Gabor T. (ed.) et al., Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13–15, 2005. Boston, MA: Birkhäuser (ISBN 978-0-8176-3614-2/hbk). Applied and Numerical Harmonic Analysis, 175-205 (2007). MSC: 90B10 PDFBibTeX XMLCite \textit{K. J. Batenburg}, in: Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005. Boston, MA: Birkhäuser. 175--205 (2007; Zbl 1175.90055)
Rangaraj, Narayan; Sohoni, Milind; Puniya, Prashant; Garg, Jugal Rake linking for suburban train services. (English) Zbl 1153.90362 Opsearch 43, No. 2, 103-116 (2006). MSC: 90B20 90B10 PDFBibTeX XMLCite \textit{N. Rangaraj} et al., Opsearch 43, No. 2, 103--116 (2006; Zbl 1153.90362) Full Text: DOI
Meyr, Herbert Simultaneous lotsizing and scheduling on parallel machines. (English) Zbl 1001.90034 Eur. J. Oper. Res. 139, No. 2, 277-292 (2002). MSC: 90B35 90C59 90C10 90B30 PDFBibTeX XMLCite \textit{H. Meyr}, Eur. J. Oper. Res. 139, No. 2, 277--292 (2002; Zbl 1001.90034) Full Text: DOI
Beraldi, P.; Guerriero, F.; Musmanno, R. Efficient parallel algorithms for the minimum cost flow problem. (English) Zbl 0902.90057 J. Optimization Theory Appl. 95, No. 3, 501-530 (1997). MSC: 90B10 65Y05 90C35 PDFBibTeX XMLCite \textit{P. Beraldi} et al., J. Optim. Theory Appl. 95, No. 3, 501--530 (1997; Zbl 0902.90057) Full Text: DOI
Curet, Norman D. Applying steepest-edge techniques to a network primal-dual algorithm. (English) Zbl 0882.90036 Comput. Oper. Res. 24, No. 7, 601-609 (1997). MSC: 90B10 PDFBibTeX XMLCite \textit{N. D. Curet}, Comput. Oper. Res. 24, No. 7, 601--609 (1997; Zbl 0882.90036) Full Text: DOI
Hindi, K. S. Solving the CLSP by a tabu search heuristic. (English) Zbl 0842.90030 J. Oper. Res. Soc. 47, No. 1, 151-161 (1996). MSC: 90B05 90C11 90B10 PDFBibTeX XMLCite \textit{K. S. Hindi}, J. Oper. Res. Soc. 47, No. 1, 151--161 (1996; Zbl 0842.90030) Full Text: DOI
Resende, Mauricio G. C.; Pardalos, Panos M. Interior point algorithms for network flow problems. (English) Zbl 1010.90525 Beasley, J. E. (ed.), Advances in linear and integer programming. Oxford: Clarendon Press. Oxf. Lect. Ser. Math. Appl. 4, 145-185 (1996). MSC: 90C51 90C35 90B10 PDFBibTeX XMLCite \textit{M. G. C. Resende} and \textit{P. M. Pardalos}, Oxf. Lect. Ser. Math. Appl. 4, 145--185 (1996; Zbl 1010.90525)
Hindi, K. S. Efficient solution of the single-item, capacitated lot-sizing problem with start-up and reservation costs. (English) Zbl 0843.90040 J. Oper. Res. Soc. 46, No. 10, 1223-1236 (1995). MSC: 90B05 90B35 PDFBibTeX XMLCite \textit{K. S. Hindi}, J. Oper. Res. Soc. 46, No. 10, 1223--1236 (1995; Zbl 0843.90040) Full Text: DOI
Bertsekas, D. P. An auction algorithm for the max-flow problem. (English) Zbl 0843.90044 J. Optimization Theory Appl. 87, No. 1, 69-101 (1995). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{D. P. Bertsekas}, J. Optim. Theory Appl. 87, No. 1, 69--101 (1995; Zbl 0843.90044) Full Text: DOI
Hindi, K. S. Algorithms for capacitated, multi-item lot-sizing without set-ups. (English) Zbl 0830.90035 J. Oper. Res. Soc. 46, No. 4, 465-472 (1995). MSC: 90B05 90B10 90B30 PDFBibTeX XMLCite \textit{K. S. Hindi}, J. Oper. Res. Soc. 46, No. 4, 465--472 (1995; Zbl 0830.90035) Full Text: DOI
Curet, Norman D. An incremental primal-dual method for generalized networks. (English) Zbl 0813.90121 Comput. Oper. Res. 21, No. 10, 1051-1059 (1994). MSC: 90C35 90B10 PDFBibTeX XMLCite \textit{N. D. Curet}, Comput. Oper. Res. 21, No. 10, 1051--1059 (1994; Zbl 0813.90121) Full Text: DOI
Li, Xiaoye; Zenios, Stavros A. Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations. (English) Zbl 0813.90043 Eur. J. Oper. Res. 79, No. 3, 474-488 (1994). MSC: 90B10 90C35 65Y05 90C08 PDFBibTeX XMLCite \textit{X. Li} and \textit{S. A. Zenios}, Eur. J. Oper. Res. 79, No. 3, 474--488 (1994; Zbl 0813.90043) Full Text: DOI
Joshi, Anil; Goldstein, Arthur S.; Vaidya, Pravin M. A fast implementation of a path-following algorithm for maximizing a linear function over a network polytope. (English) Zbl 0787.90022 Johnson, David S. (ed.) et al., Network flows and matching. 1st DIMACS Implementation Challenge. Providence, RI: American Mathematical Society. DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 12, 267-298 (1993). MSC: 90B10 90C05 90-08 90-04 65K05 PDFBibTeX XMLCite \textit{A. Joshi} et al., in: Network flows and matching. 1st DIMACS Implementation Challenge. Providence, RI: American Mathematical Society. 267--298 (1993; Zbl 0787.90022)
Bland, R. G.; Cheriyan, J.; Jensen, D. L.; Ladányi, L. An empirical study of min cost flow algorithms. (English) Zbl 0787.90019 Johnson, David S. (ed.) et al., Network flows and matching. 1st DIMACS Implementation Challenge. Providence, RI: American Mathematical Society. DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 12, 119-156 (1993). MSC: 90B10 90-08 68W10 PDFBibTeX XMLCite \textit{R. G. Bland} et al., in: Network flows and matching. 1st DIMACS Implementation Challenge. Providence, RI: American Mathematical Society. 119--156 (1993; Zbl 0787.90019)
Bertsekas, Dimitri P.; Castañon, David A. Parallel primal-dual methods for the minimum cost flow problem. (English) Zbl 0810.90032 Comput. Optim. Appl. 2, No. 4, 317-336 (1993). Reviewer: A.Girard (Verdun / Quebec) MSC: 90B10 65Y05 90C35 90C08 PDFBibTeX XMLCite \textit{D. P. Bertsekas} and \textit{D. A. Castañon}, Comput. Optim. Appl. 2, No. 4, 317--336 (1993; Zbl 0810.90032) Full Text: DOI
Bertsekas, Dimitri P.; Castañon, David A. A generic auction algorithm for the minimum cost network flow problem. (English) Zbl 0792.90024 Comput. Optim. Appl. 2, No. 3, 229-259 (1993). MSC: 90B10 91B26 PDFBibTeX XMLCite \textit{D. P. Bertsekas} and \textit{D. A. Castañon}, Comput. Optim. Appl. 2, No. 3, 229--259 (1993; Zbl 0792.90024) Full Text: DOI
Resende, Mauricio G. C.; Veiga, Geraldo An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapacitated networks. (English) Zbl 0794.90014 SIAM J. Optim. 3, No. 3, 516-537 (1993). MSC: 90B10 90C05 90C35 90-08 65F10 65K05 65Y05 90C06 90B80 PDFBibTeX XMLCite \textit{M. G. C. Resende} and \textit{G. Veiga}, SIAM J. Optim. 3, No. 3, 516--537 (1993; Zbl 0794.90014) Full Text: DOI
Bertsekas, Dimitri P.; Castañon, David A.; Tsaknakis, Haralampos Reverse auction and the solution of inequality constrained assignment problems. (English) Zbl 0778.90076 SIAM J. Optim. 3, No. 2, 268-297 (1993). MSC: 90C35 90C27 91B26 90C05 90B10 90-08 PDFBibTeX XMLCite \textit{D. P. Bertsekas} et al., SIAM J. Optim. 3, No. 2, 268--297 (1993; Zbl 0778.90076) Full Text: DOI Link
Curet, Norman D. On the dual coordinate ascent approach for nonlinear networks. (English) Zbl 0770.90023 Comput. Oper. Res. 20, No. 2, 133-140 (1993). MSC: 90B10 90-08 PDFBibTeX XMLCite \textit{N. D. Curet}, Comput. Oper. Res. 20, No. 2, 133--140 (1993; Zbl 0770.90023) Full Text: DOI
Tseng, Paul; Bertsekas, Dimitri P. Relaxation methods for monotropic programs. (English) Zbl 0694.90077 Math. Program., Ser. A 46, No. 2, 127-151 (1990). MSC: 90C25 90B10 65K05 90C05 PDFBibTeX XMLCite \textit{P. Tseng} and \textit{D. P. Bertsekas}, Math. Program. 46, No. 2 (A), 127--151 (1990; Zbl 0694.90077) Full Text: DOI
Bertsekas, Dimitri P.; Castanon, David A. The auction algorithm for the transportation problem. (English) Zbl 0705.90061 Ann. Oper. Res. 20, 67-96 (1989). MSC: 90C08 90-08 91B26 PDFBibTeX XMLCite \textit{D. P. Bertsekas} and \textit{D. A. Castanon}, Ann. Oper. Res. 20, 67--96 (1989; Zbl 0705.90061) Full Text: DOI
Aronson, Jay E. A survey of dynamic network flows. (English) Zbl 0704.90028 Ann. Oper. Res. 20, No. 1, 1-66 (1989). MSC: 90B10 90C35 90-02 PDFBibTeX XMLCite \textit{J. E. Aronson}, Ann. Oper. Res. 20, No. 1, 1--66 (1989; Zbl 0704.90028) Full Text: DOI
Bertsekas, Dimitri P.; Eckstein, Jonathan Dual coordinate step methods for linear network flow problems. (English) Zbl 0664.90031 Math. Program., Ser. B 42, No. 2, 203-243 (1988). MSC: 90B10 68Q25 90C35 65K05 PDFBibTeX XMLCite \textit{D. P. Bertsekas} and \textit{J. Eckstein}, Math. Program. 42, No. 2 (B), 203--243 (1988; Zbl 0664.90031) Full Text: DOI
Bertsekas, Dimitri P.; Tseng, Paul Relaxation methods for minimum cost ordinary and generalized network flow problems. (English) Zbl 0662.90027 Oper. Res. 36, No. 1, 93-114 (1988). Reviewer: A.Girard MSC: 90B10 90C35 65K05 PDFBibTeX XMLCite \textit{D. P. Bertsekas} and \textit{P. Tseng}, Oper. Res. 36, No. 1, 93--114 (1988; Zbl 0662.90027) Full Text: DOI Link