dblp: Optimization Letters, Volume 17 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• 

• 

• 

• 

• 
  jump to

  • Number 1
  • Number 2
  • Number 3
  • Number 4
  • Number 5
  • Number 6
  • Number 7
  • Number 8
  • Number 9

• 

• > Home > Journals > Optimization Letters

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 17, Number 1, January 2023

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

Volume 17, Number 2, March 2023

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

Volume 17, Number 3, April 2023

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

Volume 17, Number 4, May 2023

• 
  • 
  • 
  • 
  • 
    Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram:
    On atomic cliques in temporal graphs. 813-828
• 
  • 
  • 
  • 
  • 
    Samir Adly, Manh Hung Le:
    Solving inverse Pareto eigenvalue problems. 829-849
• 
  • 
  • 
  • 
  • 
    Pitchaya Wiratchotisatian, Andrew C. Trapp:
    A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables. 851-866
• 
  • 
  • 
  • 
  • 
    Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas:
    A discrete competitive facility location model with proportional and binary rules sequentially applied. 867-877
• 
  • 
  • 
  • 
  • 
    Kaining 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. 879-900
• 
  • 
  • 
  • 
  • 
    Nevena Mijajlovic, Milojica Jacimovic:
    Strong convergence theorems by an extragradient-like approximation methods for quasi-variational inequalities. 901-916
• 
  • 
  • 
  • 
  • 
    Yuzhu Wang, Akiko Yoshise:
    Evaluating approximations of the semidefinite cone with trace normalized distance. 917-934
• 
  • 
  • 
  • 
  • 
    Shaotao 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. 935-954
• 
  • 
  • 
  • 
  • 
    Zhanyin 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. 955-980
• 
  • 
  • 
  • 
  • 
    Maxim K. Sakharov, Kamila Koledina, Irek M. Gubaydullin, Anatoly P. Karpenko:
    Parallel memetic algorithm for optimal control of multi-stage catalytic reactions. 981-1003
• 
  • 
  • 
  • 
  • 
    Casper T. Röling, Stefanny Ramirez, Dario Bauso, Hamidou Tembine:
    Stochastic programming with primal-dual dynamics: a mean-field game approach. 1005-1026
• 
  • 
  • 
  • 
  • 
    M. Beni-Asad, H. Mohebi:
    Characterizations of the solution set for tangentially convex optimization problems. 1027-1048
• 
  • 
  • 
  • 
  • 
    Farzaneh Karami, Mahdi Fathi, Panos M. Pardalos:
    Conveyor operations in distribution centers: modeling and optimization. 1049-1068
• 
  • 
  • 
  • 
  • 
    Roger Behling, Yunier Bello-Cruz, Hugo Lara-Urdaneta, Harry Oviedo, Luiz-Rafael Santos:
    Circumcentric directions of cones. 1069-1081

Volume 17, Number 5, June 2023

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

Volume 17, Number 6, July 2023

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

Volume 17, Number 7, September 2023

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

Volume 17, Number 8, November 2023

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

Volume 17, Number 9, December 2023

Special issue dedicated to the 8th International Conference on Variable Neighborhood Search (ICVNS 2021)

• 
  • 
  • 
  • 
  • 
    Nenad Mladenovic, Angelo Sifaleras, Andrei Sleptchenko:
    Special issue dedicated to the 8th International Conference on Variable Neighborhood Search (ICVNS 2021). 1979-1980
• 
  • 
  • 
  • 
  • 
    Luigi 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. 1981-2003
• 
  • 
  • 
  • 
  • 
    Yogita Singh Kardam, Kamal Srivastava, Rafael Martí:
    General variable neighborhood search for the minimum stretch spanning tree problem. 2005-2031
• 
  • 
  • 
  • 
  • 
    Sinaide 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. 2033-2063
• 
  • 
  • 
  • 
  • 
    Alberto Herrán, J. Manuel Colmenar, Nenad Mladenovic, Abraham Duarte:
    A general variable neighborhood search approach for the minimum load coloring problem. 2065-2086
• 
  • 
  • 
  • 
  • 
    Luka Matijevic, Slobodan Jelic, Tatjana Davidovic:
    General variable neighborhood search approach to group steiner tree problem. 2087-2111
• 
  • 
  • 
  • 
  • 
    Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
    A no-delay single machine scheduling problem to minimize total weighted early and late work. 2113-2131
• 
  • 
  • 
  • 
  • 
    Issam 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. 2133-2134
• 
  • 
  • 
  • 
  • 
    Malek Masmoudi, Bassem Jarboui, Rahma Borchani:
    Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits. 2135-2167
• 
  • 
  • 
  • 
  • 
    Rachid Benmansour, Raca Todosijevic, Saïd Hanafi:
    Variable neighborhood search for the single machine scheduling problem to minimize the total early work. 2169-2184
• 
  • 
  • 
  • 
  • 
    Ivan A. Davydov, Yury Kochetov, Daniil Tolstykh, Xialiang Tong, Jiawen Liu:
    Hybrid variable neighborhood search for automated warehouse scheduling. 2185-2199
• 
  • 
  • 
  • 
  • 
    Abdelhak Elidrissi, Rachid Benmansour, Angelo Sifaleras:
    General variable neighborhood search for the parallel machine scheduling problem with two common servers. 2201-2231
• 
  • 
  • 
  • 
  • 
    Elias 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. 2233-2256
• 
  • 
  • 
  • 
  • 
    Ghazale Kordi, Ali Divsalar, Saeed Emami:
    Multi-objective home health care routing: a variable neighborhood search method. 2257-2298
• 
  • 
  • 
  • 
  • 
    Zorica Drazic:
    Fat-tailed distributions for continuous variable neighborhood search. 2299-2320
• 
  • 
  • 
  • 
  • 
    Mujahid N. Syed:
    Feature selection in machine learning via variable neighborhood search. 2321-2345
• 
  • 
  • 
  • 
  • 
    Pinar 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. 2347-2366

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: