Journal: Optimization Letters

Volume 17, Issue 9

1979 -- 1980Nenad Mladenovic, Angelo Sifaleras, Andrei Sleptchenko. Special issue dedicated to the 8th International Conference on Variable Neighborhood Search (ICVNS 2021)
1981 -- 2003Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina. Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping
2005 -- 2031Yogita Singh Kardam, Kamal Srivastava, Rafael Martí. General variable neighborhood search for the minimum stretch spanning tree problem
2033 -- 2063Sinaide Nunes Bezerra, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza. A general VNS for the multi-depot open vehicle routing problem with time windows
2065 -- 2086Alberto Herrán, J. Manuel Colmenar, Nenad Mladenovic, Abraham Duarte. A general variable neighborhood search approach for the minimum load coloring problem
2087 -- 2111Luka Matijevic, Slobodan Jelic, Tatjana Davidovic. General variable neighborhood search approach to group steiner tree problem
2113 -- 2131Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli. A no-delay single machine scheduling problem to minimize total weighted early and late work
2133 -- 2134Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli. Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work
2135 -- 2167Malek Masmoudi, Bassem Jarboui, Rahma Borchani. Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits
2169 -- 2184Rachid Benmansour, Raca Todosijevic, Saïd Hanafi. Variable neighborhood search for the single machine scheduling problem to minimize the total early work
2185 -- 2199Ivan A. Davydov, Yury Kochetov 0001, Daniil Tolstykh, Xialiang Tong, Jiawen Liu. Hybrid variable neighborhood search for automated warehouse scheduling
2201 -- 2231Abdelhak Elidrissi, Rachid Benmansour, Angelo Sifaleras. General variable neighborhood search for the parallel machine scheduling problem with two common servers
2233 -- 2256Elias L. Marques, Vitor Nazário Coelho, Igor Machado Coelho, Luiz Satoru Ochi, Nelson Maculan, Nenad Mladenovic, Bruno N. Coelho. A two-phase multi-objective metaheuristic for a green UAV grid routing problem
2257 -- 2298Ghazale Kordi, Ali Divsalar, Saeed Emami. Multi-objective home health care routing: a variable neighborhood search method
2299 -- 2320Zorica Drazic. Fat-tailed distributions for continuous variable neighborhood search
2321 -- 2345Mujahid N. Syed. Feature selection in machine learning via variable neighborhood search
2347 -- 2366Pinar Karadayi Atas, Aise Zülal Sevkli, Kadir Tufan. A VNS based framework for early diagnosis of the Alzheimer's disease converted from mild cognitive impairment

Volume 17, Issue 8

1711 -- 1738Bruce L. Golden, Eric Oden, S. Raghavan 0001. The rendezvous vehicle routing problem
1739 -- 1756Warren L. Hare, Clément W. Royer. Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization
1757 -- 1790Daniel Baena, Jordi Castro 0001. The Chebyshev center as an alternative to the analytic center in the feasibility pump
1791 -- 1810Nguyen Minh Tung, Nguyen Xuan Duy Bao. 1-optimization
1811 -- 1832Yuncheng Luo. Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect
1833 -- 1852Moussa Barro, Sado Traoré. An uncertain minimization problem: robust optimization versus optimization of robustness
1853 -- 1872Yongge Yang, Po-An Chen, Yu-Ching Lee, Yung-Yan Fanchiang. On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms
1873 -- 1888Enrico Angelelli, Renata Mansini, Romeo Rizzi. Solving the probabilistic profitable tour problem on a line
1889 -- 1914Hejie Wei, Wei Hong Yang, Yinsheng Chai. A Riemannian subspace BFGS trust region method
1915 -- 1937Jin Yu, Peihai Liu, Xiwen Lu. Two-agent single-machine scheduling with release dates to minimize the makespan
1939 -- 1956Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan. Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
1957 -- 1978Müzeyyen Ertürk, Ahmet Salkim. Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem

Volume 17, Issue 7

1495 -- 1515Warren L. Hare, Gabriel Jarry-Bolduc, Chayne Planiden. Nicely structured positive bases with maximal cosine measure
1517 -- 1531Monica Bianchi, Igor Konnov 0002, Rita Pini. On a threshold descent method for quasi-equilibria
1533 -- 1549Maxim D. Emelin, Ilya A. Khlystov, Dmitry S. Malyshev, Olga O. Razvenskaya. On linear algebraic algorithms for the subgraph matching problem and its variants
1551 -- 1574Lijun Ding, Madeleine Udell. A strict complementarity approach to error bound and sensitivity of solution of conic programs
1575 -- 1594Pradeep Kumar Sharma, C. S. Lalitha. Connectedness of the solution sets in generalized semi-infinite set optimization
1595 -- 1611Renbo Zhao, Qiuyun Zhu. A generalized Frank-Wolfe method with "dual averaging" for strongly convex composite optimization
1613 -- 1631Frank Permenter. Log-domain interior-point methods for convex quadratic programming
1633 -- 1641Christos E. Kountzakis, Damiano Rossello. Pareto efficiency without topology
1643 -- 1667Cheng Lu, Wenguo Yang, Suixiang Gao. Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions
1669 -- 1678Shi-Liang Wu. +-matrix
1679 -- 1695Tacildo de Souza Araújo, Douglas Soares Gonçalves, Cristiano Torezzan. A two-phase rank-based algorithm for low-rank matrix completion
1697 -- 1709Ruoke Meng, Zheng-Hai Huang, Yong Wang. Existence of the least element solution of the vertical block Z-tensor complementarity problem

Volume 17, Issue 6

1271 -- 1277Ba Khiet Le, Michel Théra. On a new simple algorithm to compute the resolvents
1279 -- 1293Agostinho Agra. A robust model for the lot-sizing problem with uncertain demands
1295 -- 1315Artem A. Panin, Aleksandr V. Plyasunov. The multilevel facility location and pricing problems: the computational complexity and the stability analysis
1317 -- 1335Phillippe Samer, Dag Haugland. Polyhedral results and stronger Lagrangean bounds for stable spanning trees
1337 -- 1358Lahoussine Lafhim, Alain B. Zemkoho. Extension of the value function reformulation to multiobjective bilevel optimization
1359 -- 1378Chongyang Liu, Zhaohua Gong, Song Wang 0004, Kok Lay Teo. Numerical solution of delay fractional optimal control problems with free terminal time
1379 -- 1412Niklas Vespermann, Thomas Hamacher, Jalal Kazempour. On ambiguity-averse market equilibrium
1413 -- 1434Xinrui Li, Yakui Huang. A gradient method exploiting the two dimensional quadratic termination property
1435 -- 1454Joel Antonio Trejo-Sánchez, Francisco A. Madera-Ramírez, José Alberto Fernández-Zepeda, José Luis López-Martínez, Alejandro Flores-Lamas. A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
1455 -- 1468Jianbin Wang, JianHua Yuan, Wenbao Ai. A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
1469 -- 1486Marduch Tadaros, Athanasios Migdalas, Björn Samuelsson. A note on the hierarchical multi-switch multi-echelon vehicle routing problem
1487 -- 1494Abdelkrim Chakib, Ibrahim Khalil, Hamid Ouaissa, Azeddine Sadik. On an effective approach in shape optimization problem for Stokes equation

Volume 17, Issue 5

1083 -- 1103Ioana Molan, Martin Schmidt 0003. Using neural networks to solve linear bilevel problems with unknown lower level
1105 -- 1125Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani. Conditions for linear convergence of the gradient method for non-convex optimization
1127 -- 1132Shmuel Onn. Degree sequence optimization in bounded treewidth
1133 -- 1159Joong-Ho Won, Kenneth Lange, Jason Xu. p-ball projection problems
1161 -- 1179Rohollah Garmanjani. Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
1181 -- 1200Qian Li, Wei Zhang. Sparse and risk diversification portfolio selection
1201 -- 1213Timotej Hrga, Janez Povh. Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B
1215 -- 1228Vyacheslav Kungurtsev, V. Shikhman. Regularized quasi-monotone method for stochastic optimization
1229 -- 1240Parth Nobel, Akshay Agrawal 0001, Stephen P. Boyd. Computing tighter bounds on the n-queens constant via Newton's method
1241 -- 1259Byung-Cheon Choi, Myoung-Ju Park. Two-machine flow shop scheduling with convex resource consumption functions
1261 -- 1262Byung-Cheon Choi, Myoung-Ju Park. Correction to: Two‑machine flow shop scheduling with convex resource consumption functions
1263 -- 1270Lei Huang. Optimality conditions for homogeneous polynomial optimization on the unit sphere

Volume 17, Issue 4

813 -- 828Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram. On atomic cliques in temporal graphs
829 -- 849Samir Adly, Manh Hung Le. Solving inverse Pareto eigenvalue problems
851 -- 866Pitchaya Wiratchotisatian, Andrew C. Trapp. A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
867 -- 877Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas. A discrete competitive facility location model with proportional and binary rules sequentially applied
879 -- 900Kaining Shao, Wenjuan Fan, Zishu Yang, Shanlin Yang, Panos M. Pardalos. A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect
901 -- 916Nevena Mijajlovic, Milojica Jacimovic. Strong convergence theorems by an extragradient-like approximation methods for quasi-variational inequalities
917 -- 934Yuzhu Wang, Akiko Yoshise. Evaluating approximations of the semidefinite cone with trace normalized distance
935 -- 954Shaotao Hu, Yuanheng Wang, Ping Jing, Qiao-Li Dong. A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces
955 -- 980Zhanyin Li, Jun Pei, Ping Yan, Ya Zhou, Panos M. Pardalos. Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint
981 -- 1003Maxim K. Sakharov, Kamila Koledina, Irek Gubaydullin, Anatoly P. Karpenko. Parallel memetic algorithm for optimal control of multi-stage catalytic reactions
1005 -- 1026Casper T. Röling, Stefanny Ramirez, Dario Bauso, Hamidou Tembine. Stochastic programming with primal-dual dynamics: a mean-field game approach
1027 -- 1048M. Beni-Asad, H. Mohebi 0001. Characterizations of the solution set for tangentially convex optimization problems
1049 -- 1068Farzaneh Karami, Mahdi Fathi 0001, Panos M. Pardalos. Conveyor operations in distribution centers: modeling and optimization
1069 -- 1081Roger Behling, Yunier Bello-Cruz, Hugo Lara-Urdaneta, Harry Oviedo, Luiz-Rafael Santos. Circumcentric directions of cones

Volume 17, Issue 3

515 -- 530Monique Laurent, Lucas Slot. An effective version of Schmüdgen's Positivstellensatz for the hypercube
531 -- 544Heinz H. Bauschke, Manish Krishan Lal, Xianfu Wang. Directional asymptotics of Fejér monotone sequences
545 -- 560Lizhi Wang. The leave-worst-k-out criterion for cross validation
561 -- 589Jeffrey Larson 0001, Misha Padidar, Stefan M. Wild. Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
591 -- 612Wenjie Li, Hailing Liu. Online NDP-constraint scheduling of jobs with delivery times or weights
613 -- 628Cheng Lu 0007, Junhao Wu, Zhibin Deng, Shaoze Li. A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
629 -- 642Manman Dong, Chunyan Wang 0020, Qingni Zhu, Haibin Chen. The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors
643 -- 656Trung Vu, Raviv Raich. A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis
657 -- 673Michael C. Burkhart. Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions
675 -- 698Alexander V. Fominyh. The subdifferential descent method in a nonsmooth variational problem
699 -- 720Lam Quoc Anh, Tran Quoc Duy. Regularization of vector equilibrium problems
721 -- 738Manxue You, Genghua Li. Approximate properly solutions of constrained vector optimization with variable coradiant sets
739 -- 751Abdullah Alasmari, Iskander Aliev. On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes
753 -- 769An Zhang 0001, Tan Zhen, Yong Chen 0002, Guangting Chen. An improved algorithm for parallel machine scheduling under additional resource constraints
771 -- 788Dennis Adelhütte, Christian Biefel, Martina Kuchlbauer, Jan Rolfes. Pareto robust optimization on Euclidean vector spaces
789 -- 811José Yunier Bello Cruz, Oday Hazaimah. On the weak and strong convergence of modified forward-backward-half-forward splitting methods

Volume 17, Issue 2

219 -- 243Bruno F. Lourenço, Gábor Pataki. A simplified treatment of Ramana's exact dual for semidefinite programming
245 -- 264Audrey Dietz, Warren Adams, Boshi Yang. A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
265 -- 282David T. Mildebrath. A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation
283 -- 297Shintaro Takenaga, Yoshihiko Ozaki, Masaki Onishi. Practical initialization of the Nelder-Mead method for computationally expensive optimization problems
299 -- 332Rashed Khanjani Shiraz, Ali Babapour Azar, Zohreh Hosseini Nodeh, Panos M. Pardalos. Distributionally robust joint chance-constrained support vector machines
333 -- 350Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita. Convergence rates analysis of a multiobjective proximal gradient method
351 -- 367Saman Babaie-Kafaki, Nasrin Mirhoseini, Zohre Aminifard. A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
369 -- 383Le Dung Muu, Xuan Thanh Le, Nguyen Ngoc Hai. On the proximal mapping for multi-valued monotone variational inequality problems
385 -- 397Christian Bingane. Largest small polygons: a sequential convex optimization approach
399 -- 412Luis M. Briceño-Arias, Fernando Roldán. Resolvent of the parallel composition and the proximity operator of the infimal postcomposition
413 -- 435Hao Wang 0045, Hao Zeng, Jiashan Wang. p regularization problems
437 -- 451Simon Laumer. Efficient compact linear programs for network revenue management
453 -- 469Yi Lei, Hu Shao, Ting Wu 0009, Pengjie Liu. An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
471 -- 492Johannes Milz. Sample average approximations of strongly convex stochastic programs in Hilbert spaces
493 -- 509Xiangyu Cui, Duan Li 0002, Yun Shi, Mingjia Zhu. Hybrid strategy in multiperiod mean-variance framework
511 -- 513Jonathan Gillard. Review on the book Yaroslav D. Sergeyev, Renato De Leone (Eds.) Numerical infinities and infinitesimals in optimization

Volume 17, Issue 1

1 -- 26Temitayo Ajayi, Taewoo Lee, Andrew J. Schaefer. A note on the implications of approximate submodularity in discrete optimization
27 -- 44Pascal Heid. A link between the steepest descent method and fixed-point iterations
45 -- 74Burla E. Ondes, Susan R. Hunter. An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
75 -- 87Xinyi Zuo, Yi Jiang. Solution methodologies for minimizing a sum of pointwise minima of two functions
89 -- 105Shuhan Kou, Bruce L. Golden, Stefan Poikonen. Optimal TSP tour length estimation using Sammon maps
107 -- 120Olga I. Kostyukova, Tatiana V. Tchemisova. An exact explicit dual for the linear copositive programming problem
121 -- 141Hui Ouyang. Bregman circumcenters: monotonicity and forward weak convergence
143 -- 162Shujun Bi, Zhen Yin, Yihong Weng. A low-rank spectral method for learning Markov models
163 -- 175Debdatta Sinha Roy, Bruce L. Golden, Adriano Masone, Edward A. Wasil. Using regression models to understand the impact of route-length variability in practical vehicle routing
177 -- 190Sholom Schechtman. Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set
191 -- 210Jing Yang, Xueyu Shi, Oleg A. Prokopyev. Exact solution approaches for a class of bilevel fractional programs
211 -- 218Milan Hladík, Hossein Moosaei. Some notes on the solvability conditions for absolute value equations