Results 11 to 20 of about 4,101,445 (240)

Chebyshev Centers that are Not Farthest Points [PDF]

open access: yesIndian Journal of Pure and Applied Mathematics, 2018
In this paper we address the question whether in a given Banach space, a Chebyshev center of a nonempty bounded subset can be a farthest point of the set. Our exploration reveals that the answer depends on the convexity properties of the Banach space.
Sain, Debmalya   +3 more
openaire   +4 more sources

The Chebyshev center as an alternative to the analytic center in the feasibility pump

open access: yesOptimization Letters, 2023
As a heuristic for obtaining feasible points of mixed integer linear problems, the feasibility pump (FP) generates two sequences of points: one of feasible solutions for the relaxed linear problem; and another of integer points obtained by rounding the ...
Daniel Baena, J. Castro
semanticscholar   +1 more source

Algorithms for Constructing Optimal Covering of Planar Figures with Disks Sets of Linearly Different Radii

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2023
The problem of optimal covering of plane figures with sets of a fixed number of different circles is considered. We suppose that each circle has a radius equal to the sum of the parameter common to all and its individual number. The main aim of the paper
P. D. Lebedev, K. L. Stoychin
doaj   +1 more source

Soft radio frequency microstrip bandpass filter: Precise design and demonstration

open access: yesAIP Advances, 2023
A soft and tunable microwave bandpass Chebyshev microstrip end-coupled filter is demonstrated on a polydimethylsiloxane substrate based on high electrically conductive composites made of silver nanoparticle-covered flakes, even with large strain.
Wei He   +7 more
doaj   +1 more source

SFCFOS Uniform and Chebyshev Amplitude Distribution Linear Array Antenna for K-Band Applications [PDF]

open access: yesJournal of the Korean Institute of Electromagnetic Engineering and Science, 2019
In this study, a compact series-fed center-fed open-stub (SFCFOS) linear array antenna for K-band applications is presented. The antenna is composed of a single-line 10-element linear array. A symmetrical Chebyshev amplitude distribution (CAD) is used to
Venkata Kishore Kothapudi
doaj   +1 more source

Node Local Similarity Based Two-stage Density Peaks Algorithm for Overlapping Community Detection [PDF]

open access: yesJisuanji kexue, 2022
In order to detect overlapping community structures in complex networks,the idea of density peaks clustering algorithm is introduced.However,applying the density peaks clustering algorithm to community detection still has problems such as how to measure ...
DUAN Xiao-hu, CAO Fu-yuan
doaj   +1 more source

On Covering Bounded Sets by Collections of Circles of Various Radii

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2020
This paper is devoted to the problem of constructing an optimal covering of a two-dimensional figure by the union of circles. The radii of the circles, generally speaking, are different.
A.L. Kazakov   +2 more
doaj   +1 more source

ENUMERATION OF MEANDERS AND MASUR–VEECH VOLUMES

open access: yesForum of Mathematics, Pi, 2020
A meander is a topological configuration of a line and a simple closed curve in the plane (or a pair of simple closed curves on the 2-sphere) intersecting transversally. Meanders can be traced back to H.
VINCENT DELECROIX   +3 more
doaj   +1 more source

Parallel solution of Lambert’s problem using modified Chebyshev-Picard iteration method

open access: yesNiğde Ömer Halisdemir Üniversitesi Mühendislik Bilimleri Dergisi, 2022
Lambert’s problem is one of the classical methods for solving the multiple revolution problem in orbit determination. With the increasing interest in space exploration programs and using satellite networks, it is important to provide an accurate and ...
Majd Ajroudi, Fahreddin Şükrü Torun
doaj   +1 more source

Methods of optimization of Hausdorff distance between convex rotating figures [PDF]

open access: yesYugoslav Journal of Operations Research, 2020
We studied the problem of optimizing the Hausdorff distance between two convex polygons. Its minimization is chosen as the criterion of optimality. It is believed that one of the polygons can make arbitrary movements on the plane, including parallel ...
Lebedev Pavel, Ushakov Vladimir
doaj   +1 more source

Home - About - Disclaimer - Privacy