By default Calc in Apache Office ships with a solver engine for linear programming only. This allows the optimization of models to a certain degree. However, if the formulas or constraints become more complex, nonlinear programming is required. That missing gap
Work with the Polymath project was published on Research in the Mathematical Sciences
The work with the Polymath project was published on Research in the Mathematical Sciences. D. H. J. Polymath. Variants of the Selberg sieve, and bounded intervals containing many primes.Research in the Mathematical Sciences, 2014, 1(12): 1-83. [DOI] Here is the list
Work on cooperative group optimization system was published on Soft Computing
The cooperative group optimization system (CGOS) consists of a group of compact agents cooperating with their peers in a sharing environment for realizing a common intention of finding high-quality solution(s) based on the internal landscape representation of an optimization task. Xiao-Feng Xie,
(Constrained) Numerical Optimization Problem (NOP)
Applications: Optimization and Synthesis for Semiconductor Devices; Engineer Optimization Problems Related Frameworks: Swarm Algorithm Framework (SWAF) Related Algorithms: (Parallel) Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Social Cognitive Optimization (SCO), and Electromagnetism-like Mechanism (EM) Heuristic, etc. Related
Work on solving the Graph Coloring Problem was published on Journal of Combinatorial Optimization
MAOS-GCP is a cooperative group optimization system for solving the Graph Coloring Problem (GCP). It has been tested and achieved optimal solutions efficiently for large-scale instances. The binary code can be downloaded from the portal. Xiao-Feng Xie, Jiming Liu. Graph coloring