Journal: Optimization Letters

Volume 15, Issue 8

2529 -- 2540Ulrich Pferschy, Joachim Schauer, Clemens Thielen. Approximating the product knapsack problem
2541 -- 2554Afrooz Jalilzadeh. Primal-dual incremental gradient method for nonsmooth and convex optimization problems
2555 -- 2575Hongtan Sun, Thomas C. Sharkey. Decentralized scheduling with precedence constraints
2577 -- 2595Mina Aliakbari, Joseph Geunes, Kelly M. Sullivan. The single train shortest route problem in a railyard
2597 -- 2610Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne. Complexity of near-optimal robust versions of multilevel optimization problems
2611 -- 2637F. Tevhide Altekin, Abdullah Dasci, Mumtaz Karatas. Linear and conic reformulations for the maximum capture location problem under multinomial logit choice
2639 -- 2660Hao Wang 0045, Hao Zeng, Jiashan Wang, Qiong Wu 0005. 1 regularization
2661 -- 2680Qiao Zhang, Xiucui Guan, Hui Wang, Panos M. Pardalos. Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance
2681 -- 2700Nizare Riane, Claire David. Optimization on fractal sets
2701 -- 2718Yang Xu, Zheng-Hai Huang. Bounds of the solution set of the tensor complementarity problem
2719 -- 2732Goran Banjac, John Lygeros. On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
2733 -- 2756M. Hoffhues, Werner Römisch, Thomas M. Surowiec. On quantitative stability in infinite-dimensional optimization under uncertainty
2757 -- 2772Utkan Candogan, Yong Sheng Soh, Venkat Chandrasekeran. A note on convex relaxations for the inverse eigenvalue problem
2773 -- 2792A. V. Fominyh. The quasidifferential descent method in a control problem with nonsmooth objective functional
2793 -- 2812Jeremy D. Jordan, Stan Uryasev. Shortest path network problems with stochastic arc weights
2813 -- 2829Maurizio Bruglieri, Simona Mancini, Ornella Pisacane. A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
2831 -- 2860Shummin Nakayama, Jun-ya Gotoh. On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
2861 -- 2878Samir Adly, Ba Khiet Le. Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions
2879 -- 2895Pablo Soares, Manoel B. Campêlo. t-Linearization for the maximum diversity problem
2897 -- 2899Yaroslav D. Sergeyev. Review on the book Anatoly Zhigljavsky, Antanas Žilinskas "Bayesian and High-Dimensional Global Optimization", SpringerBriefs in Optimization, Springer, 2021

Volume 15, Issue 7

2347 -- 2349Hoai An Le Thi, Tao Pham Dinh, Yaroslav D. Sergeyev. Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8-10, 2019
2351 -- 2375Abdelouafi Ghazi, Ahmed Roubi. Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
2377 -- 2405Thi Thuy Tran, Hoai An Pham Thi, Tao Pham Dinh, Nhu Tuan Nguyen. DC programming and DCA for enhancing physical layer security via relay beamforming strategies
2407 -- 2432Yi-Shuai Niu, Yu You, Wenxu Xu, Wentao Ding, Junpeng Hu, Songquan Yao. A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
2433 -- 2454Joanna Berlinska, Alexander V. Kononov, Yakov Zinder. Two-machine flow shop with dynamic storage space
2455 -- 2468Marco Cococcioni, Lorenzo Fiaschi. The Big-M method with the numerical infinite M
2469 -- 2495Victor Gergel, Evgeniy Kozinov, Konstantin Barkalov. Computationally efficient approach for solving lexicographic multicriteria optimization problems
2497 -- 2514Shapour Heidarkhani, Shahin Moradi, Giuseppe Caristi. Existence results for a dynamic Sturm-Liouville boundary value problem on time scales
2515 -- 2528Milan Hladík, David Hartman, Moslem Zamani. Maximization of a PSD quadratic form and factorization

Volume 15, Issue 6

1835 -- 1845Jean B. Lasserre. The moment-SOS hierarchy and the Christoffel-Darboux kernel
1847 -- 1863Akang Wang, Nicholas Ferro, Rita A. Majewski, Chrysanthos E. Gounaris. Mixed-integer linear optimization for full truckload pickup and delivery
1865 -- 1884Linas Stripinis, Remigijus Paulavicius. A new DIRECT-GLh algorithm for global optimization with hidden constraints
1885 -- 1904Massimiliano Caramia. Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach
1905 -- 1930Mathieu Lacroix, Yasmín Á. Ríos-Solís, Roberto Wolfler Calvo. Efficient formulations for the traveling car renter problem and its quota variant
1931 -- 1953Shen Peng, Abdel Lisser, Vikas Vikram Singh, Nalin Gupta, Eshan Balachandar. Games with distributionally robust joint chance constraints
1955 -- 1971Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov. Two-Bar Charts Packing Problem
1973 -- 1992Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore. A dynamic programming algorithm for solving the k-Color Shortest Path Problem
1993 -- 2003Sandi Klavzar, Mostafa Tavakoli. Edge metric dimensions via hierarchical product and integer linear programming
2005 -- 2015Calogero Orlando, Angela Ricciardello. Analytic solution of the continuous particle swarm optimization problem
2017 -- 2024Shi-Liang Wu, Shu-Qian Shen. On the unique solution of the generalized absolute value equation
2025 -- 2052Bo Xu, Bo Wen. On the convergence of a class of inertial dynamical systems with Tikhonov regularization
2053 -- 2065Lu Han, Dachuan Xu, Dandan Liu, Chenchen wu. An approximation algorithm for the k-level facility location problem with outliers
2067 -- 2108Anubha Goel, Aparna Mehra. Robust Omega ratio optimization using regular vines
2109 -- 2126Yekini Shehu, Aviv Gibali. New inertial relaxed method for solving split feasibilities
2127 -- 2145A. Khan, M. Sama. Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories
2147 -- 2164YunCheng Liu, Fuquan Xia. Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
2165 -- 2180Xiaofei Liu, Weidong Li 0002. Approximation algorithms for the multiprocessor scheduling with submodular penalties
2181 -- 2199Duong Viet Thong, Jun Yang, Yeol Je Cho, Themistocles M. Rassias. Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities
2201 -- 2224Vo Duc Thinh, Thai Doan Chuong, Nguyen Le Hoang Anh. Second order variational analysis of disjunctive constraint sets and its applications to optimization problems
2225 -- 2240Mohammad Hossein Alizadeh. On generalized convex functions and generalized subdifferential II
2241 -- 2254Moslem Zamani, Milan Hladík. A new concave minimization algorithm for the absolute value equation solution
2255 -- 2273Andrei Patrascu, Paul Irofti. Stochastic proximal splitting algorithm for composite minimization
2275 -- 2297O. J. Ibarra-Rojas, Y. Silva-Soto. Vehicle routing problem considering equity of demand satisfaction
2299 -- 2309Diego Cifuentes. On the Burer-Monteiro method for general semidefinite programs
2311 -- 2319Dan-Yang Lv, Ji-Bo Wang. Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
2321 -- 2329Martin Frohn. On the approximability of the fixed-tree balanced minimum evolution problem
2331 -- 2341Milan Hladík, Michal Cerný, Miroslav Rada. A new polynomially solvable class of quadratic optimization problems with box constraints
2343 -- 0Fani Boukouvala, Chrysanthos E. Gounaris. Correction to: A preface to the special issue in memory of Professor Christodoulos A. Floudas
2345 -- 0Patrizia Daniele, Laura Scrimali 0001. Correction to: Preface

Volume 15, Issue 5

1507 -- 1508Patrizia Daniele, Laura Scrimali 0001. Preface
1509 -- 1535Avelina Alejo-Reyes, Abraham Mendoza, Elías Olivares Benítez. Inventory replenishment decisions model for the supplier selection problem facing low perfect rate situations
1537 -- 1551Qamrul Hasan Ansari, Truong Quang Bao. A limiting subdifferential version of Ekeland's variational principle in set optimization
1553 -- 1564Edoardo Bastianetto, Sara Ceschia, Andrea Schaerf. Solving a home energy management problem by Simulated Annealing
1565 -- 1577Patrizia Beraldi, Annarita De Maio, Demetrio Laganà, Antonio Violi. A pick-up and delivery problem for logistics e-marketplace services
1579 -- 1586Luca Bertazzi, Jeffrey W. Ohlmann. Direct k-routing versus cross-docking: worst-case results
1587 -- 1600Francesco Carrabs, Ciriaco D'Ambrosio, Andrea Raiconi. Optimization of sensor battery charging to maximize lifetime in a wireless sensors network
1601 -- 1616Gabriella Colajanni, Patrizia Daniele. A new model for curriculum-based university course timetabling
1617 -- 1648Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani. Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem
1649 -- 1664Alberto De Santis, Umberto Dellepiane, Stefano Lucidi, Stefania Renzi. A derivative-free optimization approach for the autotuning of a Forex trading strategy
1665 -- 1689Gianni Di Pillo, Marcello Fabiano, Stefano Lucidi, Massimo Roma. Cruise itineraries optimal scheduling
1691 -- 1709Georgia Fargetta, Laura R. M. Scrimali. Generalized Nash equilibrium and dynamics of popularity of online contents
1711 -- 1733Giorgio Gnecco, Federico Nutarelli. On the trade-off between number of examples and precision of supervision in machine learning problems
1735 -- 1758Wei-Bo Guan, Wen Song. The forward-backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces
1759 -- 1772Liguo Jiao, Do Sang Kim, Yuying Zhou. Quasi ε-solutions in a semi-infinite programming problem with locally Lipschitz data
1773 -- 1783Igor Konnov 0002. Application of the penalty method to limit quasi-equilibrium problems
1785 -- 1798Francesco Mezzadri, Emanuele Galligani. A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems
1799 -- 1819Mauro Passacantando, Fabio Raciti. Optimal road maintenance investment in traffic networks with random demands
1821 -- 1834Constantin Udriste, Elena-Laura Otobîcu, Ionel Tevy. Multitime hybrid differential games with multiple integral functional

Volume 15, Issue 4

1027 -- 1040Thomas Kleinert, Martine Labbé, Fränk Plein, Martin Schmidt 0003. Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
1041 -- 1060Viet Hung Nguyen, Michel Minoux. Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results
1061 -- 1079Mahsa Moghaddass, Daria Terekhov. Inverse integer optimization with multiple observations
1081 -- 1103Ningji Wei, Jose L. Walteros, McKenzie R. Worden, Héctor J. Ortiz-Peña. A resiliency analysis of information distribution policies over mobile ad hoc networks
1105 -- 1112Chenfei Hou, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou. An approximation algorithm for the submodular multicut problem in trees with linear penalties
1113 -- 1131Hongzhi Wei, Chunrong Chen, Baowei Wu. Vector network equilibrium problems with uncertain demands and capacity constraints of arcs
1133 -- 1154Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang. A loopless algorithm for generating (k, m)-ary trees in Gray code order
1155 -- 1173Hailing Liu, Xiwen Lu, Wenjie Li. A best possible online algorithm for parallel batch scheduling with delivery times and limited restart
1175 -- 1194Tran Van Su, Nguyen Duc Hien. Strong Karush-Kuhn-Tucker optimality conditions for weak efficiency in constrained multiobjective programming problems in terms of mordukhovich subdifferentials
1195 -- 1214Jaeyoong Lim, Sungsoo Park. On using cardinality constrained uncertainty for objective coefficients in robust optimization
1215 -- 1227El Houcine Bergou, Youssef Diouane, Vyacheslav Kungurtsev. Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure
1229 -- 1239Li Guan, Weidong Li 0002, Man Xiao. Online algorithms for the mixed ring loading problem with two nodes
1241 -- 1261C. L. Yao, J. W. Chen. Vector conjugation and subdifferential of vector topical function in complete lattice
1263 -- 1276Bruno Dinis, Pedro Pinto. On the convergence of algorithms with Tikhonov regularization terms
1277 -- 1291Patrick Mehlitz, Leonid Minchenko, Alain B. Zemkoho. A note on partial calmness for bilevel optimization problems with linearly structured lower level
1293 -- 1302Stefan Kober, Stefan Weltge. Improved lower bound on the dimension of the EU council's voting rules
1303 -- 1325Tomohiko Mizutani. Improved analysis of spectral algorithm for clustering
1327 -- 1343Settar Mustu, Tamer Eren. The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects
1345 -- 1369Bruno Costa e Silva Nogueira, Rian G. S. Pinheiro, Eduardo Tavares. Iterated local search for the generalized independent set problem
1371 -- 1383Josep Freixas. A characterization of weighted simple games based on pseudoweightings
1385 -- 1396Giorgio Zucchi, Manuel Iori, Anand Subramanian 0001. Personnel scheduling during Covid-19 pandemic
1397 -- 1406Adil I. Erzin, Natalya Lagutkina. FPTAS for barrier covering problem with equal touching circles in 2D
1407 -- 1423André Renato Sales Amaral. A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order
1425 -- 1446S. Ansary Karbasy, Abdelouahed Hamdi, M. Salahi, A. Taati. An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints
1447 -- 1455Ilya Minarchenko, Oleg Khamisov. On minimization of a quadratic function with one negative eigenvalue
1457 -- 1474Gang Cai, Qiao-Li Dong, Yu Peng. Strong convergence theorems for inertial Tseng's extragradient method for solving variational inequality problems and fixed point problems
1475 -- 1483Jiawen Gao, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou. An approximation algorithm for the k-generalized Steiner forest problem
1485 -- 1490Stuart M. Harwood, Dimitri J. Papageorgiou, Francisco Trespalacios. A note on semi-infinite program bounding methods
1491 -- 1504Michael R. Metel, Akiko Takeda. Primal-dual subgradient method for constrained convex optimization problems
1505 -- 0Bismark Singh. Correction to: Fairness criteria for allocating scarce resources

Volume 15, Issue 3

813 -- 815Samir Adly, Mohammad Hossein Alizadeh, Fabián Flores Bazán. Special issue on variational analysis, optimization and their applications
817 -- 832Monica Bianchi, Igor V. Konnov 0002, Rita Pini. Limit vector variational inequalities and market equilibrium problems
833 -- 846Poonam Kesarwani, Joydeep Dutta. Charnes-Cooper scalarization and convex vector optimization
847 -- 858B. Khazayel, A. Farajzadeh. New vectorial versions of Takahashi's nonconvex minimization problem
859 -- 877Iván Aguirre-Cipe, Rubén López, Exequiel Mallea-Zepeda, Lautaro Vásquez. A study of interval optimization problems
879 -- 900Ouayl Chadli, Gábor Kassay, Asma Saidi. On the existence of antiperiodic solutions for hemivariational inequalities: an equilibrium problem approach
901 -- 921Qamrul Hasan Ansari, Feeroz Babu. Proximal point algorithm for inclusion problems in Hadamard manifolds with applications
923 -- 931Majid Fakhar, M. Lotfipour, Jafar Zafarani. Abstract convexity in KKM theorems via set-valued maps
933 -- 952Dang Van Cuong, Boris S. Mordukhovich, Nguyen Mau Nam. Quasi-relative interiors for graphs of convex set-valued mappings
953 -- 977F. Bazargan, H. Mohebi. New qualification conditions for convex optimization without convex representation
979 -- 989Suliman Al-Homidan, Loai Shaalan. Approximation of quasiconvex functions by neatly quasiconvex functions
991 -- 1007Jorge Amaya, Cristopher Hermosilla, Emilio Molina. Optimality conditions for the continuous model of the final open pit problem
1009 -- 1026Salman Khodayifar. Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle

Volume 15, Issue 2

289 -- 310Archis Ghate. Inverse conic linear programs in Banach spaces
311 -- 326Dmitriy S. Malyshev. The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable
327 -- 336Bismark Singh. Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
337 -- 355Jean Paulo Martins, Bruno Cesar Ribas. A randomized heuristic repair for the multidimensional knapsack problem
357 -- 376Zsolt Darvay, Tibor Illés, Csilla Majoros. Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
377 -- 389Yun-Hui Lin, Qingyun Tian. Exact approaches for competitive facility location with discrete attractiveness
391 -- 404Diana C. Montañés, Adolfo J. Quiroz, Mateo Dulce Rubio, Alvaro Riascos. Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces
405 -- 418Felix Lieder. On the convergence rate of the Halpern-iteration
419 -- 429Chang Liang, Yuning Yang. A note on Banach's results concerning homogeneous polynomials associated with nonnegative tensors
431 -- 440Maksim Barketau. Evaluation of solution of discrete optimization problem with incomplete input
441 -- 457Li Chu, Bo Wang, Liwei Zhang, Hongwei Zhang. The rate of convergence of proximal method of multipliers for second-order cone optimization problems
459 -- 468Evren Olcaytu, Gültekin Kuyzu. An efficient bidding heuristic for simultaneous truckload transportation auctions
469 -- 494Baoyu Liao, Haoxin Wang, Xing Zhu, Shanlin Yang, Panos M. Pardalos. Improved DE search for competing groups scheduling with deterioration effects
495 -- 511Xiaoxi Zhu, Miaomiao Wang. Optimal pricing strategy of a hybrid trade old for new and remanufactured products supply chain
513 -- 535Guoqiang Wang, He Luo, Xiaoxuan Hu, Shanlin Yang. Communication topology optimization for three-dimensional persistent formation with leader constraint
537 -- 551Shaojun Lu, Xinbao Liu, Jun Pei, Panos M. Pardalos. Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines
553 -- 567Bayi Cheng, Huijun Zhu, Bo-hai Liu, Minglun Ren. Minmizing service span with batch-position-based learning effects
569 -- 590Xiaonong Lu, Zhanglin Peng, Qiang Zhang, Shanlin Yang. Event-based optimization approach for solving stochastic decision problems with probabilistic constraint
591 -- 612Qiang Zhang, Zhanglin Peng, Xiaonong Lu, Han Su, Wenxing Lu. An adaptive agent-based process model for optimizing innovative design
613 -- 626L. Q. Anh, P. T. Duoc, T. N. Tam, N. C. Thang. Stability analysis for set-valued equilibrium problems with applications to Browder variational inclusions
627 -- 648Pham Ngoc Anh, Nguyen Van Hong. New projection methods for equilibrium problems over fixed point sets
649 -- 667Maciej Drwal. Robust approach to restricted items selection problem
669 -- 683Jianping Li, Yujie Zheng, Junran Lichen, Wencheng Wang. On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${\mathbb {R}}^2$
685 -- 700Zishen Yang, Majun Shi, Wei Wang 0032. Greedy approximation for the minimum connected dominating set with labeling
701 -- 710Pascal Bianchi, Walid Hachem, Adil Salim. A fully stochastic primal-dual algorithm
711 -- 718Rentsen Enkhbat, Batbileg Sukhee. Optimization approach to Berge equilibrium for bimatrix game
719 -- 731Nguyen Nang Tam, Tran Van Nghi. On the solution existence to convex polynomial programs and its applications
733 -- 755Taibo Luo, Hongmei Li, Shaofeng Ru, Weitian Tong, Yinfeng Xu. Multiple sink location problem in path networks with a combinational objective
757 -- 777Duong Viet Thong, Xiao-Huan Li, Qiao-Li Dong, Yeol Je Cho, Themistocles M. Rassias. An inertial Popov's method for solving pseudomonotone variational inequalities
779 -- 801Rafal Kamocki. Existence of optimal solutions to Lagrange problems for ordinary control systems involving fractional Laplace operators
803 -- 812Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo. On the computational complexity of uncapacitated multi-plant lot-sizing problems

Volume 15, Issue 1

1 -- 2Pavlo A. Krokhmal, Oleg A. Prokopyev. Optimization Letters Best Paper Award for 2019
3 -- 8Yohann de Castro, Fabrice Gamboa, Didier Henrion, Jean-Bernard Lasserre. Dual optimal design and the Christoffel-Darboux polynomial
9 -- 23Miguel F. Anjos, Manuel V. C. Vieira. Mathematical optimization approach for facility layout on several rows
25 -- 44D. Woolnough, Vaithilingam Jeyakumar, Guoyin Li 0001. Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
45 -- 57Chayne Planiden. Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
59 -- 81Gustavo de Araujo Sabry, Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg, Matheus da Silva Menezes, Zailton Sachas Amorim Calheiros. Models and linearizations for the Traveling Car Renter with Passengers
83 -- 96Adil M. Bagirov, Sona Taheri, Kaisa Joki, Napsu Karmitsa, Marko M. Mäkelä. Aggregate subgradient method for nonsmooth DC optimization
97 -- 107Wissem Achour, Djamal Chaabane, Víctor Blanco. An improved algorithm to compute the ømega-primality
109 -- 125Yanchao Liu. A note on solving DiDi's driver-order matching problem
127 -- 136Horst Alzer, Man Kam Kwong, Gradimir V. Milovanovic. On the zeros of lacunary-type polynomials
137 -- 152Dmitriy S. Malyshev, O. O. Razvenskaya, Panos M. Pardalos. 2, 3-free graphs
153 -- 170Armando Teles Dauer, Bruno de Athayde Prata. Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
171 -- 188Vo Si Trong Long. A new notion of error bounds: necessary and sufficient conditions
189 -- 203Hui Zhang, Lili Pan, Naihua Xiu. 0-regularization
205 -- 229Dang Van Hieu 0001, Abdellatif Moudafi. Regularization projection method for solving bilevel variational inequality problem
231 -- 247Samir Elhedhli, Fatma Gzara, Cynthia Waltho. Green supply chain design with emission sensitive demand: second order cone programming formulation and case study
249 -- 262Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng. A note on competing-agent Pareto-scheduling
263 -- 269Simon Foucart. Facilitating OWL norm minimizations
271 -- 286Eduardo Lalla-Ruiz, Martijn Mes. Mathematical formulations and improvements for the multi-depot open vehicle routing problem
287 -- 288Antanas Zilinskas. Review on the SpriengerBriefs monograph "deterministic global optimization: an introduction to the diagonal approach"