The uncertain capacitated arc routing problem (UCARP) is an NP-hard combinatorial optimization problem with a wide range of applications in logistics domains. Genetic programming (GP) hyper-heuristic ...

We develop a polynomial-time procedure to handle a class of generalized fractional programming (GFP) problems with Toeplitz-Hermitian quadratics exploiting the linear matrix inequality (LMI) ...

Add this topic to your repo To associate your repository with the programming-homework-2 topic, visit your repo's landing page and select "manage topics." Learn more ...

Erie Insurance is working with law enforcement as the company attempts to determine the source of what it is calling an information security event. The problem was discovered June 7 when the ...

The Abel prizewinner’s pragmatic approach to solving differential equations was influential across fields ranging from weather forecasting to starting nuclear chain reactions.