Validation of subgradient optimization

From MaRDI portal

Publication:4770776

Jump to:navigation, search

DOI10.1007/BF01580223zbMath0284.90057WikidataQ56814043 ScholiaQ56814043MaRDI QIDQ4770776

Harlan P. Crowder, Michael Held, Philip Wolfe

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

Projections onto the canonical simplex with additional linear inequalities, Unnamed Item, Subgradient optimization applied to a discrete nonlinear problem in engineering design, Lagrangean decomposition/relaxation for the routing and wavelength assignment problem, Capacitated disassembly scheduling with random demand, The Newton Bracketing Method for Convex Minimization: Convergence Analysis, Auction-based distributed scheduling in a dynamic job shop environment, Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée, A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, Comparative study of two fast algorithms for projecting a point to the standard simplex, Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function, A direct dual method for the mixed plant location problem with some side constraints, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, Combinatorial Heuristics for Inventory Routing Problems, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses, An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply, A generalization of Polyak's convergence result for subgradient optimization, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, Optimal regularized hypothesis testing in statistical inverse problems, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, Relaxation techniques applied to some loading problems, On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance, Note on a method of conjugate subgradients for minimizing nondifferentiable functions, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, Unnamed Item, Planning Online Advertising Using Gini Indices, On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem, The edge-disjoing steiner problem in graphs, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, A dual scheme for traffic assignment problems, Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints, Optimal prioritized channel allocation in cellular mobile systems, A modified subgradient algorithm for Lagrangean relaxation, Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing, A Lagrangian relaxation approach to the edge-weighted clique problem, A dual algorithm for the one-machine scheduling problem, A hierarchical approach for metal parts fabrication, A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem, Planning and coordination of production and distribution facilities for multiple commodities, On convergence rates of subgradient optimization methods, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Study on the multicommodity reliability of a capacitated-flow network, Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout, Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints, The traveling salesman problem: A duality approach, Optimal locations of switches and interconnections for ATM LANs, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, Lagrangian heuristics for the quadratic knapsack problem, Affinity propagation and uncapacitated facility location problems, AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING, Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods, On Solving the Quadratic Shortest Path Problem, A polynomially bounded algorithm for a singly constrained quadratic program, Calculating surrogate constraints, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut, Determinantal Point Processes for Image Processing, Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network, Investigation of optimization methods and their applications, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Solving Basis Pursuit, A Primal Approach to the Simple Plant Location Problem, Optimal set partitioning, matchings and lagrangian duality, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Topological design of a centralized communication network with unreliable links and node outage costs, On using approximations of the Benders master problem, Solving a class of network models for dynamic flow control, Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs, A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships, Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Capacity analysis in repetitive assemble-to-order manufacturing systems, Maximizing the value of a space mission, Constrained multi-project planning problems: A Lagrangean decomposition approach, A Lagrangean decomposition solution to a single line multiproduct scheduling problem, A surrogate heuristic for set covering problems, A quadratic integer programming method for minimizing the mean squared deviation of completion times, Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem, On some difficult linear programs coming from set partitioning, Flexible solutions to maritime inventory routing problems with delivery time windows, Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times, Sample-path optimization of convex stochastic performance functions, Truck synchronization at single door cross-docking terminals, Channel allocation in cellular radio networks, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, Routing and capacity assignment in backbone communication networks, Solving the anti-covering location problem using Lagrangian relaxation, A model for the capacitated \(p\)-facility location problem in global environments, A structural Lagrangean relaxation for two-duty period bus driver scheduling problems, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Subgradient method with entropic projections for convex nondifferentiable minimization, A constrained Steiner tree problem, Assignment of tools to machines in a flexible manufacturing system, Solution of a tinned iron purchasing problem by Lagrangean relaxation, Minmax combinatorial optimization, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, A method for the cutting stock problem with different qualities, A classification of formulations for the (time-dependent) traveling salesman problem, A multicriteria approach to the location of public facilities, Set partitioning mit linearen Randbedingungen, Decentralised scheduling with confidentiality protection, An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation, On the choice of step size in subgradient optimization, A hybrid algorithm for solving network flow problems with side constraints., An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\), A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization, Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints., A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, Effective algorithm and heuristic for the generalized assignment problem., A tree search algorithm for the p-median problem, A heuristic decomposition approach to optimal control in a water supply model, Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs., Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, On the quadratic assignment problem, Variable target value subgradient method, The hierarchical network design problem with transshipment facilities, New overlapping coordination methodologies for large-scale optimization problems, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Exchanges procedures for timetabling problems, Decomposition methods for the two-stage stochastic Steiner tree problem, The \(K\)-coverage concentrator location problem, A Langrangean heuristic for the \(p_ k\)-median dynamic location problem, On the continuous quadratic knapsack problem, Integrating facility layout with process selection and capacity planning, Configuration of fully replicated distributed database system over wide area networks, Locating concentrators in centralized computer networks, The multicovering problem, A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions, Four solution techniques for a general one machine scheduling problem. A comparative study, Some numerical methods for limit analysis in continuum mechanics, An interactive method as an aid in solving multi-objective mathematical programming problems, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem, A due date assignment algorithm for multiproduct manufacturing facilities, Conditional subgradient optimization -- theory and applications, Primary and secondary route selection in backbone communication networks, Multicommodity flow models for spanning trees with hop constraints, Single machine earliness and tardiness scheduling, A Lagrangean heuristic for the facility location problem with staircase costs, Mean value cross decomposition applied to integer programming problems, A multiperiod two-echelon multicommodity capacitated plant location problem, Plant location with minimum inventory, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, A constrained nonlinear 0-1 program for data allocation, Estimating the Held-Karp lower bound for the geometric TSP, Semi-obnoxious location models: A global optimization approach, Minimal spanning trees with a constraint on the number of leaves, The return plant location problem: Modelling and resolution, Designing reliable tree networks with two cable technologies, An effective implementation of the Lin-Kernighan traveling salesman heuristic, A simplicial decomposition method for the transit equilibrium assignment problem, Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, A technique for speeding up the solution of the Lagrangean dual, Inexact subgradient methods with applications in stochastic programming, Experiments with parallel branch-and-bound algorithms for the set covering problem, An improved subgradient method for constrained nondifferentiable optimization, Scheduling identical parallel machines to minimize total weighted completion time, A set covering reformulation of the pure fixed charge transportation problem, A model and methodologies for the location problem with logistical components, Analyzing tradeoffs between zonal constraints and accessibility in facility location, Studying the effects of production loss due to setup in dynamic production scheduling, On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Lagrangean relaxation. (With comments and rejoinder)., Efficient projection algorithms onto the weighted \(\ell_1\) ball, Preventive maintenance scheduling of power generating units, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, Solving large-scale profit maximization capacitated lot-size problems by heuristic methods, Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes, The capacitated minimum spanning tree problem: On improved multistar constraints, A globally convergent method for solving a quartic generalized Markowitz portfolio problem, A monotonic, dual-based bounding procedure for integer programs, Dynamic supply chain design with inventory, Modeling and solving the rooted distance-constrained minimum spanning tree problem, A Lagrangian relaxation algorithm for sparse quadratic assignment problems, Using integer programming techniques for the solution of an experimental design problem, Dynamic bundle methods, A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations, Efficient decomposition and linearization methods for the stochastic transportation problem, Algorithms for the solution of stochastic dynamic minimax problems, The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems, Exact makespan minimization of unrelated parallel machines, Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints, Optimizing production capacity and safety stocks in general acyclic supply chains, Equitable routing of rail hazardous materials shipments using CVaR methodology, A Lagrangian decomposition scheme for choice-based optimization, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, A Lagrangian relaxation-based heuristic for the vehicle routing with full container load, On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint, A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A multiperiod planning model for the capacitated minimal spanning tree problem, A variable target value method for nondifferentiable optimization, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, A survey on the continuous nonlinear resource allocation problem, Solving the swath segment selection problem through Lagrangean relaxation, An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Formulations and exact algorithms for the vehicle routing problem with time windows, A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs., Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, A new cross decomposition method for stochastic mixed-integer linear programming, Stochastic facility location with general long-run costs and convex short-run costs, Heuristic algorithms for dynamic capacitated lotsizing for production flow networks with setup times, A two-echelon stochastic facility location model for humanitarian relief logistics, Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT), Performance evaluation for a transportation system in stochastic case, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, A Lagrangian approach for minimum cost single round robin tournaments, An exact approach for scheduling jobs with regular step cost functions on a single machine, An integrated disaster preparedness model for retrofitting and relief item transportation, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Bounds for the single source modular capacitated plant location problem, Using Lagrangian dual information to generate degree constrained spanning trees, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Lower bounds from state space relaxations for concave cost network flow problems, A branch-and-bound algorithm for concave network flow problems, A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem, Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem, Near-optimal solutions to large-scale facility location problems, Exact disclosure prevention in two-dimensional statistical tables, A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over, Planning capacity and safety stocks in a serial production-distribution system with multiple products, Alternate solution approaches for competitive hub location problems, An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem, Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop, Modeling formulation and a new heuristic for the railroad blocking problem, Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system, Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures, A new upper bound for the 0-1 quadratic knapsack problem, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Lagrangean/surrogate relaxation for generalized assignment problems, A note on a dynamic space-allocation method for outbound containers., Lagrangian relaxation of the generic materials and operations planning model, Using short-term memory to minimize the weighted number of late jobs on a single machine., SSN: learning sparse switchable normalization via SparsestMax, Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint, A fast algorithm for solving linear inverse problems with uniform noise removal, A primal-dual subgradient method for time staged capacity expansion planning, Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer, Future paths for integer programming and links to artificial intelligence, A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering, A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\), Efficient proximal mapping computation for low-rank inducing norms, Stronger \(K\)-tree relaxations for the vehicle routing problem, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Multicast tree rearrangement to recover node failures in overlay multicast networks, The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market, Design of capacitated degree constrained min-sum arborescence, Accelerating the convergence of subgradient optimisation, A multiperiod degree constrained minimal spanning tree problem, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems, A Lagrangian heuristic for capacitated single item lot sizing problems, Single machine scheduling with symmetric earliness and tardiness penalties, Solving the shortest route cut and fill problem using simulated annealing, Convergence analysis for the modified spectral projected subgradient method, An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand, Multi-item spare parts systems with lateral transshipments and waiting time constraints, The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm, An integer programming model for the allocation of databases in a distributed computer system, Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Efficient algorithms for the capacitated concentrator location problem, A new Lagrangian relaxation approach to the generalized assignment problem, A computational evaluation of two subgradient search methods, Fast projection onto the simplex and the \(l_1\) ball, Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming, Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation, On the solution of multidimensional convex separable continuous knapsack problem with bounded variables, Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints, Two fast algorithms for projecting a point onto the canonical simplex, Convergence and computational analyses for some variable target value and subgradient deflection methods, Finding minimum and equitable risk routes for hazmat shipments, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering, Generalized route planning model for hazardous material transportation with VaR and equity considerations, Incorporating location, inventory and price decisions into a supply chain distribution network design problem, Traffic engineering of tunnel-based networks with class specific diversity requirements, A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs, Zone pricing for time-definite LTL freight transportation with elastic demand, Heuristics for the multi-item capacitated lot-sizing problem with lost sales, A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times, Lower bounds and exact algorithms for the quadratic minimum spanning tree problem, Cluster Lagrangean decomposition in multistage stochastic optimization, Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity, Solving network manpower problems with side constraints, Layering strategies for creating exploitable structure in linear and integer programs, Application of Lagrangian relaxation to computer network control, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A hop constrained min-sum arborescence with outage costs, System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem, A two-item two-warehouse periodic review inventory model with transshipment, Multiple machine continuous setup lotsizing with sequence-dependent setups, A Newton's method for the continuous quadratic knapsack problem, Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm, A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem, Approximate solutions to large scale capacitated facility location problems, A method for solving to optimality uncapacitated location problems, A surrogate and Lagrangian approach to constrained network problems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Improved Lagrangean decomposition: An application to the generalized assignment problem, An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, Exact algorithms for the joint object placement and request routing problem in content distribution networks, Variable fixing algorithms for the continuous quadratic Knapsack problem, A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, Optimal partitioning of a data set based on the \(p\)-median model, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Multi-level multi-item lot size planning with limited resources and general manufacturing structure., Mixed-integer bilinear programming problems, Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths, Capacitated emergency facility siting with multiple levels of backup, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Experiments with LAGRASP heuristic for set \(k\)-covering, Symmetric weight constrained traveling salesman problem: Local search, Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems, New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems, New bundle methods for solving Lagrangian relaxation dual problems, Benefit sharing in holding situations, Models for a traveling purchaser problem with additional side-constraints, The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation, Two-direction subgradient method for non-differentiable optimization problems, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, A Benders decomposition based heuristic for the hierarchical production planning problem, On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems, Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory, Two ``well-known properties of subgradient optimization, Heuristically guided algorithm for k-parity matroid problems, The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs, A computational evaluation of a general branch-and-price framework for capacitated network location problems, A Lagrangian relaxation approach to large-scale flow interception problems, Ein Subgradientenverfahren zur Klassifikation qualitativer Daten, Cut generation for an employee timetabling problem, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem, Large-scale mixed integer programming: Benders-type heuristics, A comparison of two dual-based procedures for solving the p-median problem, A tree search algorithm for the multi-commodity location problem, Solving capacitated clustering problems, A note on solving large p-median problems, Zero-one integer programs with few contraints - lower bounding theory, Projections onto order simplexes, Reoptimization procedures for bounded variable primal simplex network algorithms, Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry, A partial dual algorithm for the capacitated warehouse location problem, 'Multidimensional' extensions and a nested dual approach for the m-median problem, A multiperiod min-sum arborescence problem, About Lagrangian methods in integer optimization, Airline crew scheduling: state-of-the-art, Non delayed relax-and-cut algorithms

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4770776&oldid=19058014"