Optimal covering points and curves

DOI10.3934/math.2019.6.1796zbMath1486.52050OpenAlexW2998384899WikidataQ126460515 ScholiaQ126460515MaRDI QIDQ2126961

Yanyan Li

Publication date: 19 April 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2019.6.1796

zbMATH Keywords

coveringexperimental designoptimal networksregularized Newton methodfuel cell channels

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Newton-type methods (49M15) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cites Work

• Unnamed Item
• Optimal covering of plane domains by circles via hyperbolic smoothing
• Optimal urban networks via mass transportation
• Covering a compact polygonal set by identical circles
• A new formulation for the conditional \(p\)-median and \(p\)-center problems
• Packing up to 50 equal circles in a square
• Covering a rectangle with equal circles
• Improved coverings of a square with six and eight equal circles
• Covering a square by equal circles
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Hexagonal Economic Regions Solve the Location Problem
• The Densest Packing of 9 Circles in a Square

This page was built for publication: Optimal covering points and curves