Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Letters, Volume 16
Volume 16, Number 1, January 2022
- Nenad Mladenovic
, Panos M. Pardalos, Angelo Sifaleras, Rachid Benmansour:
Preface to the special issue on variable neighborhood search. 1-4 - Abdessamad Ouzidan, Marc Sevaux, Alexandru-Liviu Olteanu, Eduardo G. Pardo, Abraham Duarte:
On solving the order processing in picking workstations. 5-35 - Yassine Adouani, Bassem Jarboui, Malek Masmoudi:
A matheuristic for the 0-1 generalized quadratic multiple knapsack problem. 37-58 - Thiago Henrique Nogueira, Helena Ramalhinho Dias Lourenço, Carlos Roberto Venâncio de Carvalho, Martín Gómez Ravetti:
A hybrid VNS-Lagrangean heuristic framework applied on single machine scheduling problem with sequence-dependent setup times, release dates and due dates. 59-78 - Eduardo Theodoro Bogue, Huggo Silva Ferreira, Thiago F. Noronha, Christian Prins:
A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows. 79-95 - Janio Carlos Nascimento Silva, Igor Machado Coelho, Uéverton S. Souza, Luiz Satoru Ochi, Vitor Nazário Coelho:
Finding the Maximum Multi Improvement on neighborhood exploration. 97-115 - Min Kong, Jing Zhou, Jun Pei, Xinbao Liu, Panos M. Pardalos:
A modified variable neighborhood search algorithm for manufacturer selection and order acceptance in distributed virtual manufacturing network. 117-135 - Saber Ibrahim, Bassem Jarboui:
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems. 137-151 - Michael J. Brusco, Douglas L. Steinley:
A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data. 153-174 - Xiaoning Zang, Li Jiang, Mustapha Ratli, Bin Ding:
A parallel variable neighborhood search for solving covering salesman problem. 175-190 - Souhir Elleuch, Bassem Jarboui, Nenad Mladenovic, Jun Pei:
Variable neighborhood programming for symbolic regression. 191-210 - Panagiotis Karakostas, Angelo Sifaleras, Michael C. Georgiadis:
Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem. 211-235 - Souhir Elleuch, Bassem Jarboui, Nenad Mladenovic:
Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming. 237-253 - Moussa Abderrahim, Abdelghani Bekrar, Damien Trentesaux, Nassima Aissani, Karim Bouamrane:
Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints. 255-280 - Mustapha Ratli, Dragan Urosevic, Abdessamad Ait El Cadi, Jack Brimberg, Nenad Mladenovic, Raca Todosijevic:
An efficient heuristic for a hub location routing problem. 281-300 - Jesús Sánchez-Oro, Ana Dolores López-Sánchez, J. Manuel Colmenar:
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem. 301-331 - Li Jiang, Xiaoning Zang, Junfeng Dong, Changyong Liang, Nenad Mladenovic:
A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak. 333-353 - André L. S. Souza, Marcella Bernardo, Puca Huachi Vaz Penna, Jürgen Pannek, Marcone J. F. Souza:
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects. 355-374 - Li Jiang, Xiaoning Zang, Junfeng Dong, Changyong Liang:
A covering traveling salesman problem with profit in the last mile delivery. 375-393 - Vitor Nazário Coelho, Roozbeh Haghnazar Koochaksaraei:
Non-dominated solutions for time series learning and forecasting. 395-408 - Nenad Mladenovic, Jun Pei, Panos M. Pardalos, Dragan Urosevic:
Less is more approach in optimization: a road to artificial intelligence. 409-420
Volume 16, Number 2, March 2022
- Ashwin Arulselvan, Kerem Akartunali, Wilco van den Heuvel:
Economic lot-sizing problem with remanufacturing option: complexity and algorithms. 421-432 - Dimitris Bertsimas, Jack Dunn, Lea Kapelevich, Rebecca Zhang:
Sparse regression over clusters: SparClur. 433-448 - Daniele Catanzaro, Stefano Coniglio, Fabio Furini:
On the exact separation of cover inequalities of maximum-depth. 449-469 - Manuel Iori, Vinícius Loti de Lima, Silvano Martello, Michele Monaci:
2DPackLib: a two-dimensional cutting and packing library. 471-480 - Dmitry B. Mokeev, Dmitry S. Malyshev:
On partial descriptions of König graphs for odd paths and all their spanning supergraphs. 481-496 - Ronald G. McGarvey, Andreas Thorsen:
Nested-solution facility location models. 497-514 - Canh V. Pham, Dung V. Pham, Bao Q. Bui, Anh V. Nguyen:
Minimum budget for misinformation detection in online social networks with provable guarantees. 515-544 - Duong Viet Thong, Prasit Cholamjiak, Michael Th. Rassias, Yeol Je Cho:
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems. 545-573 - Ta Quang Son, Do Sang Kim:
A dual scheme for solving linear countable semi-infinite fractional programming problems. 575-588 - Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Héctor Ramírez, Daiana O. Santos, Paulo Silveira:
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. 589-610 - Ulrich Kohlenbach:
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space. 611-621 - Byung-Cheon Choi, Kyung Min Kim, Yunhong Min, Myoung-Ju Park:
Scheduling with generalized and periodic due dates under single- and two-machine environments. 623-633 - Robert Burlacu:
On refinement strategies for solving ${\textsc {MINLP}\mathrm{s}}$ by piecewise linear relaxations: a generalized red refinement. 635-652 - Nazih Abderrazzak Gadhi, Mohammed El Idrissi:
Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem. 653-666 - Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum partial multi-cover under a geometric setting. 667-680 - Scott Roy, Lin Xiao:
On self-concordant barriers for generalized power cones. 681-694 - Elimhan N. Mahmudov:
Optimization of boundary value problems for higher order differential inclusions and duality. 695-712 - Zvi Drezner, Pawel Jan Kalczynski, Alfonsas Misevicius, Gintaras Palubeckis:
Finding optimal solutions to several gray pattern instances. 713-722 - Michael Orlitzky:
Tight bounds on Lyapunov rank. 723-728 - Jakub Wiktor Both:
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces. 729-743
Volume 16, Number 3, April 2022
- Sandra D. Eksioglu, Sauleh Siddiqui, Yu Wei:
Special issue: Optimization in natural resources, environment and sustainability. 745 - Denys Yemshanov, Robert G. Haight, Ning Liu, Rob Rempel, Frank H. Koch, Art Rodgers:
Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach. 747-788 - Jorge A. Duarte, Andrés D. González, Jonathan J. Gourley:
Wildfire burn scar encapsulation. 789-819 - Bayram Dundar, Ronald G. McGarvey, Francisco X. Aguilar:
Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement. 821-844 - Sinem Tokcaer, Hayri Önal, Özgür Özpeynirci:
Designing an optimal contract mechanism in a cellulosic biofuel enterprise. 845-875 - Mathias Berger, David Radu, Antoine Dubois, Hrvoje Pandzic, Yury Dvorkin, Quentin Louveaux, Damien Ernst:
Siting renewable power generation assets with combinatorial optimisation. 877-907 - Berkay Gulcan, Sandra D. Eksioglu, Yongjia Song, Mohammad S. Roni, Qiushi Chen:
Optimization models for integrated biorefinery operations. 909-951 - Omar Abbaas, José A. Ventura:
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network. 953-982 - Drew P. Kouri:
A matrix-free trust-region newton algorithm for convex-constrained optimization. 983-997 - Huajun Wang, Yuan-Hai Shao, Naihua Xiu:
Proximal operator and optimality conditions for ramp loss SVM. 999-1014 - Matteo Tacchi:
Convergence of Lasserre's hierarchy: the general case. 1015-1033 - Yacine Chaiblaine, Mustapha Moulaï:
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program. 1035-1049 - Mitsuhiro Nishijima, Kazuhide Nakata:
A block coordinate descent method for sensor network localization. 1051-1071 - Baruch Mor, Dana Shapira:
Minsum scheduling with acceptable lead-times and optional job rejection. 1073-1091 - Nils-Hassan Quttineh, Torbjörn Larsson:
Dissecting the duality gap: the supporting hyperplane interpretation revisited. 1093-1102 - Edoardo Bastianetto, Sara Ceschia, Andrea Schaerf:
Correction to: Solving a home energy management problem by Simulated Annealing. 1103
Volume 16, Number 4, May 2022
- Jean B. Lasserre:
Homogeneous polynomials and spurious local minima on the unit sphere. 1105-1118 - M. Seetharama Gowda:
Commutation principles for optimization problems on spectral sets in Euclidean Jordan algebras. 1119-1128 - Michel De Lara, Jean-Baptiste Hiriart-Urruty:
A fresh geometrical look at the general S-procedure. 1129-1135 - Cuicui Zheng, James M. Calvin:
Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions. 1137-1151 - Pawel Jan Kalczynski, Zvi Drezner:
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location. 1153-1166 - Farhad Farokhi:
Distributionally-robust machine learning using locally differentially-private data. 1167-1179 - Nir Halman, Uriel Vinetz:
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences. 1181-1196 - Z. Fathi, Behroz Bidabad, M. Najafpour:
An exact penalty function method for optimal control of a dubins airplane in the presence of moving obstacles. 1197-1213 - Yichen Yang, Zhaohui Liu, Wei Yu:
Approximation algorithms for the k-depots Hamiltonian path problem. 1215-1234 - Quoc Tran-Dinh:
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm. 1235-1257 - Francesca Guerriero, Rosita Guido:
Modeling a flexible staff scheduling problem in the Era of Covid-19. 1259-1279 - Maxim V. Dolgopolik:
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates. 1281-1300 - Noam Goldberg, Michael Poss:
Linearized formulations for failure aware barter exchange. 1301-1313 - Tijani Amahroq, Ikram Daidai, Abdessamad Oussarhan, Aicha Syam:
Uniform convexity, uniform monotonicity and (φ , c)-subdifferentiability with application to nonlinear PDE. 1315-1336 - Juan Enrique Martínez-Legaz, Wilfredo Sosa:
Duality for quasiconvex minimization over closed convex cones. 1337-1352 - Juan Enrique Martínez-Legaz, Wilfredo Sosa:
Correction to: Duality for quasiconvex minimization over closed convex cones. 1353-1354
Volume 16, Number 5, June 2022
- Martin Schmidt, Mathias Sirvent, Winnifried Wollner:
The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities. 1355-1372 - Bismark Singh, Oliver Rehberg, Theresa Groß, Maximilian Hoffmann, Leander Kotzur, Detlef Stolten:
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models. 1373-1391 - Shmuel Onn:
Matching orderable and separable hypergraphs. 1393-1401 - Dmitriy S. Malyshev, O. V. Pristavchenko:
An intractability result for the vertex 3-colourability problem. 1403-1409 - Meghan Shanks, Sheldon H. Jacobson:
Online total bipartite matching problem. 1411-1426 - Shiliang Wu, Cuixia Li:
A class of new modulus-based matrix splitting methods for linear complementarity problem. 1427-1443 - Ling Gai, Chenchen Wu, Dachuan Xu, Weiwei Zhang:
Selfish bin packing under Harmonic mean cost sharing mechanism. 1445-1456 - Xiang-Kai Sun, Xinyi Feng, Kok Lay Teo:
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data. 1457-1476 - Nguyen Van Hung, André A. Keller:
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani-Fan-Glicksberg fixed-point theorem. 1477-1493 - Najmeh Hoseini Monjezi, S. Nobakhtian:
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems. 1495-1511 - Vu Trung Hieu:
On the solution existence and stability of polynomial optimization problems. 1513-1529 - Carlos A. Alfaro, Sergio L. Perez, Carlos E. Valencia, Marcos Cesar Vargas Magana:
The assignment problem revisited. 1531-1548 - Yu-Li Huang, Ishtiak Sikder, Guanglin Xu:
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming. 1549-1562 - Shunyu Yao, Neng Fan, Jie Hu:
Modeling the spread of infectious diseases through influence maximization. 1563-1586 - Jianping Li, Pengxiang Pan, Lijian Cai, Junran Lichen, Wencheng Wang:
Bin packing with divisible item sizes and rejection penalties. 1587-1597 - Bastian Harrach:
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming. 1599-1609
Volume 16, Number 6, July 2022
- Cédric Josz, Lexiao Lai:
Nonsmooth rank-one matrix factorization landscape. 1611-1631 - Giampaolo Liuzzi, Marco Locatelli, Veronica Piccialli:
A computational study on QP problems with general linear constraints. 1633-1647 - Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani:
The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions. 1649-1661 - Manuel Radons, Siegfried M. Rump:
Convergence results for some piecewise linear solvers. 1663-1673 - Fan Jiang, Zhongming Wu, Xingju Cai, Hongchao Zhang:
Unified linear convergence of first-order primal-dual algorithms for saddle point problems. 1675-1700 - Nguyen Le Hoang Anh, Nguyen Manh Truong Giang, Nguyen Vy Thong:
Higher-order tangent derivative and its applications to sensitivity analysis. 1701-1724 - Suthep Suantai, Bancha Panyanak, Suparat Kesornprom, Prasit Cholamjiak:
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration. 1725-1744 - Nader Ghaffari-Nasab:
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem. 1745-1772 - Harry Oviedo:
Implicit steepest descent algorithm for optimization with orthogonality constraints. 1773-1797 - Nguyen Hai Son, Tuan Anh Dao:
Upper semicontinuity of the solution map to a parametric boundary optimal control problem with unbounded constraint sets. 1799-1815 - Junfeng Ren:
Single machine batch scheduling with non-increasing time slot costs. 1817-1833 - Nguyen Van Tuyen:
A note on approximate proper efficiency in linear fractional vector optimization. 1835-1845 - Yadong Shu, Bo Li:
Expected value based optimal control for discrete-time stochastic noncausal systems. 1847-1879 - Chong Cui, Shengjie Li:
Path connectedness of the efficient solution set for generalized vector quasi-equilibrium problems. 1881-1893 - Yasir Arfat, Poom Kumam, Muhammad Aqeel Ahmad Khan, Parinya Sa Ngiamsunthorn:
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces. 1895-1913 - Andrei Sipos:
Quantitative inconsistent feasibility for averaged mappings. 1915-1925 - Rentsen Enkhbat:
A note on Anti-Nash equilibrium for bimatrix game. 1927-1933 - Luis Augusto San-José, Manuel González-de La Rosa, Joaquín Sicilia, Jaime Febles-Acosta:
An inventory model for multiple items assuming time-varying demands and limited storage. 1935-1961 - Romain Ageron:
Trigonometric approximation of the Max-Cut polytope is star-like. 1963-1967
Volume 16, Number 7, September 2022
- Panos M. Pardalos, Alexander V. Kononov, Vladimir V. Mazalov:
Preface to the special issue dedicated to the International Conference "Mathematical optimization theory and Operations Research" (MOTOR 2020) held online from July 6 to July 10, 2020. 1969-1970 - Yuliya V. Chirkova, Vladimir V. Mazalov:
Optimal externalities in a parallel transportation network. 1971-1989 - Dmitry V. Gribanov, Nikolai Yu. Zolotykh:
On lattice point counting in $\varDelta $-modular polyhedra. 1991-2018 - Dmitry Gromov, Anton Bondarev, Ekaterina V. Gromova:
On periodic solution to control problem with time-driven switching. 2019-2031 - Jun-ichi Itaya, Pierre von Mouche:
Equilibrium uniqueness in aggregative games: very practical conditions. 2033-2058 - Vasilii Novitskii, Alexander V. Gasnikov:
Improved exploitation of higher order smoothness in derivative-free optimization. 2059-2071 - Chong-Yang Shao, Zai-Yun Peng, Yi-bin Xiao, Yong Zhao:
Connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets in complete metric space. 2073-2093 - Andrey V. Savchenko, Vladimir V. Savchenko, Lyudmila V. Savchenko:
Gain-optimized spectral distortions for pronunciation training. 2095-2113 - Vladimir Shenmaier:
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension. 2115-2122 - Innokentiy Shibaev, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Zeroth-order methods for noisy Hölder-gradient functions. 2123-2143 - Daniil Tiapkin, Alexander V. Gasnikov, Pavel E. Dvurechensky:
Stochastic saddle-point optimization for the Wasserstein barycenter problem. 2145-2175 - Sergey O. Semenov, Nikolai Yu. Zolotykh:
How to find the convex hull of all integer points in a polyhedron? 2177-2189
Volume 16, Number 8, November 2022
- Felix Kirschner, Etienne de Klerk:
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere. 2191-2208 - Tobias Lehmann, Max-K. von Renesse, Alexander Sambale, André Uschmajew:
A note on overrelaxation in the Sinkhorn algorithm. 2209-2220 - Javiera Barrera, Eduardo Moreno, Gonzalo Muñoz:
Convex envelopes for ray-concave functions. 2221-2240 - Giandomenico Mastroeni, Letizia Pellegrini, Alberto Peretti:
On linear problems with complementarity constraints. 2241-2260 - Ke Li, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
Nearly tight approximation algorithm for (connected) Roman dominating set. 2261-2276 - Shuailing Feng, Wen Huang, Lele Song, Shihui Ying, Tieyong Zeng:
Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds. 2277-2297 - Maxim V. Balashov:
Chebyshev center and inscribed balls: properties and calculations. 2299-2312 - Jonatas B. C. Chagas, Markus Wagner:
Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach. 2313-2331 - John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini:
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. 2333-2358 - Paul Armand, Ngoc Nguyen Tran:
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications. 2359-2371 - Xiaofei Liu, Weidong Li, Runtao Xie:
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. 2373-2385 - Xiaoxi Jia, Lingling Xu:
A projection-like method for quasimonotone variational inequalities without Lipschitz continuity. 2387-2403 - Chunming Tang, Yanni Li, Jinbao Jian, Haiyan Zheng:
A new restricted memory level bundle method for constrained convex nonsmooth optimization. 2405-2434 - Wei-Bo Guan, Wen Song:
The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces. 2435-2456 - Lam Quoc Anh, Pham Thanh Duoc, Tran Thi Thuy Duong:
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems. 2457-2468 - Siddhartha Nambiar, Alexander G. Nikolaev, Eduardo Pasiliao:
Triply stochastic sequential assignment problem with the uncertainty in worker survival. 2469-2482 - Anna Nagurney, Deniz Besik:
Spatial price equilibrium networks with flow-dependent arc multipliers. 2483-2500 - Miguel A. Goberna, Michel Volle:
Duality for convex infinite optimization on linear spaces. 2501-2510 - Miguel A. Goberna, Michel Volle:
Correction to: Duality for convex infinite optimization on linear spaces. 2511 - Varun Suriyanarayana, Onur Tavaslioglu, Ankit B. Patel, Andrew J. Schaefer:
Reinforcement learning of simplex pivot rules: a proof of concept. 2513-2525
Volume 16, Number 9, December 2022
- Tim Mitchell, Michael L. Overton:
On properties of univariate max functions at local maximizers. 2527-2541 - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust inventory problem with budgeted cumulative demand uncertainty. 2543-2556 - Evgeny R. Gafarov, Alexandre Dolgui:
On lower and upper bounds for single machine parallel batch scheduling. 2557-2567 - Bogdan Grechuk, Dawei Hao:
Individual and cooperative portfolio optimization as linear program. 2569-2589 - Jie Jiang, Shengjie Li:
Statistical robustness of two-stage stochastic variational inequalities. 2591-2605 - Carlos Andrés Gamboa, Davi Michel Valladão, Alexandre Street:
On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems. 2607-2644 - Jin Qian, Guisong Chang:
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. 2645-2648 - Van Dung Nguyen, Bang Công Vu:
Convergence analysis of the stochastic reflected forward-backward splitting algorithm. 2649-2679 - Maria Elena Bruni, Sara Khodaparasti, Iris Martínez-Salazar, Samuel Nucamendi-Guillén:
The multi-depot k-traveling repairman problem. 2681-2709 - Roberto Baldacci, Marco Caserta, Emiliano Traversi, Roberto Wolfler Calvo:
Robustness of solutions to the capacitated facility location problem with uncertain demand. 2711-2727 - Ge Li, Jicheng Li:
QN-tensor and tensor complementarity problem. 2729-2751 - Bin Ge, Xiangwu Zhuge, Haixin Ren:
Convergence rates of damped inerial dynamics from multi-degree-of-freedom system. 2753-2774 - János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
Guillotine cutting is asymptotically optimal for packing consecutive squares. 2775-2785 - Vasily V. Gusev:
Cooperative congestion games: existence of a Nash-stable coalition structure. 2787-2801
a service of 
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.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
