NEOS

NEOS Server: State-of-the-Art Solvers for Numerical Optimization. The NEOS Server is a free internet-based service for solving numerical optimization problems. Hosted by the Wisconsin Institutes for Discovery at the University of Wisconsin in Madison, the NEOS Server provides access to more than 60 state-of-the-art solvers in more than a dozen optimization categories. The NEOS Server offers a variety of interfaces for accessing the solvers. Solvers hosted by the University of Wisconsin in Madison run on distributed high-performance machines enabled by the HTCondor software; remote solvers run on machines at Argonne National Laboratory, Arizona State University, the University of Klagenfurt in Austria, and the University of Minho in Portugal. The NEOS Guide web site complements the NEOS Server, showcasing optimization case studies, presenting optimization information and resources, and providing background information on the NEOS Server


References in zbMATH (referenced in 84 articles , 1 standard article )

Showing results 1 to 20 of 84.
Sorted by year (citations)

1 2 3 4 5 next

  1. Arpón, Sebastián; Homem-de-Mello, Tito; Pagnoncelli, Bernardo: Scenario reduction for stochastic programs with conditional value-at-risk (2018)
  2. Dufossé, Fanny; Kaya, Kamer; Panagiotas, Ioannis; Uçar, Bora: Further notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices (2018)
  3. Bertsimas, Dimitris; King, Angela: Logistic regression: from art to science (2017)
  4. Hanks, Robert W.; Weir, Jeffery D.; Lunday, Brian J.: Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets (2017)
  5. Le Thi, Hoai An; Pham Dinh, Tao: Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model (2017)
  6. Newby, Eric; Ali, M. M.: Linear transformation based solution methods for non-convex mixed integer quadratic programs (2017)
  7. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  8. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  9. Hu, T. C.; Kahng, Andrew B.: Linear and integer programming made easy (2016)
  10. Yoda, Kunikazu; Prékopa, András: Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (2016)
  11. Zhang, Jiaxiang; Qiao, Wei; Wen, John T.; Julius, Agung: Light-based circadian rhythm control: entrainment and optimization (2016)
  12. Cai, Yongyang; Judd, Kenneth L.: Dynamic programming with Hermite approximation (2015)
  13. Deng, Zhibin; Fang, Shu-Cherng; Jin, Qingwei; Lu, Cheng: Conic approximation to nonconvex quadratic programming with convex quadratic constraints (2015)
  14. Deo, Sarang; Rajaram, Kumar; Rath, Sandeep; Karmarkar, Uday S.; Goetz, Matthew B.: Planning for HIV screening, testing, and care at the veterans health administration (2015)
  15. Gago-Vargas, J.; Hartillo, I.; Puerto, J.; Ucha, J. M.: An improved test set approach to nonlinear integer problems with applications to engineering design (2015)
  16. Lee, Yu-Ching; Pang, Jong-Shi; Mitchell, John E.: An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (2015)
  17. Oliveira, José A.; Ferreira, João; Dias, Luis; Figueiredo, Manuel; Pereira, Guilherme: The non-emergency patient transport modelled as a team orienteering problem (2015)
  18. Domes, Ferenc; Fuchs, Martin; Schichl, Hermann; Neumaier, Arnold: The optimization test environment (2014)
  19. Eskandarpour, Majid; Nikbakhsh, Ehsan; Zegordi, Seyed Hessameddin: Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach (2014)
  20. Fernandes, Isaac F.; Aloise, Daniel; Aloise, Dario J.; Hansen, Pierre; Liberti, Leo: On the Weber facility location problem with limited distances and side constraints (2014)

1 2 3 4 5 next