Volumetric Barrier Cutting Plane Algorithms for Stochastic Linear Semi-Infinite Optimization
IEEE Access, 2020 In this paper, we study the two-stage stochastic linear semi-infinite programming with recourse to handle uncertainty in data defining (deterministic) linear semi-infinite programming.
Baha Alzalg, Asma Gafour, Lewa Alzaleq
doaj +1 more source
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
, 2022 We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak of sizes n1×n,…,nk×n, respectively, where D[i1,…,ik] is equal to ∑ℓ=1nA1[i1,ℓ]×…×Ak[ik,ℓ].
Lingas, Andrzej +6 more
core +1 more source
Randomized Parameterized Algorithms for the Kidney Exchange Problem [PDF]
, 2019 In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries.
Bin Fu +7 more
core +1 more source
On a Nonsmooth Gauss–Newton Algorithms for Solving Nonlinear Complementarity Problems [PDF]
, 2020 In this paper, we propose a new version of the generalized damped Gauss–Newton method for solving nonlinear complementarity problems based on the transformation to the nonsmooth equation, which is equivalent to some unconstrained optimization problem ...
Marek J. Śmietański +1 more
core +1 more source
Computational RNA secondary structure design: empirical complexity and improved methods
BMC Bioinformatics, 2007 Background We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various classes of RNA structures as the size of the target structure is increased ...
Condon Anne +2 more
doaj +1 more source
The sparse awakens : streaming algorithms for matching size estimation in sparse graphs [PDF]
, 2017 Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models.
Muthukrishnan, S. +3 more
core +1 more source
Generalized Queue-Aware Resource Management and Scheduling for Wireless Communications
IEEE Access, 2015 The general problem of a queue-aware radio resource management and scheduling design is investigated for wireless communications under quasi-static fading channel conditions.
Ning Wang +3 more
doaj +1 more source
Joint likelihood estimation and model order selection for outlier censoring
IET Radar, Sonar & Navigation, 2021 This study deals with the problem of outlier censoring from the secondary data in a radar scenario, where the number of outliers is unknown. To this end, a procedure consisting of joint likelihood estimation and statistical model order selection (MOS) is
Seyed Mohammad Karbasi
doaj +1 more source
Energy-aware lot sizing problem: Complexity analysis and exact algorithms [PDF]
International Journal of Production Economics, 2018 Abstract The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing.
Christophe Rapine +2 more
openaire +1 more source
Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
Discrete Dynamics in Nature and Society, 2013 Spatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture.
Xiyu Liu, Jie Xue
doaj +1 more source