Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Some polynomial programming problems solving with a clustering algorithm

From MaRDI portal
Publication:2714177
Jump to:navigation, search

zbMATH Open0962.90053MaRDI QIDQ2714177

István Borgulya

Publication date: 12 June 2001

Published in: Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei (Search for Journal in Brave)




zbMATH Keywords

clustering algorithmpolynomial programmingbenchmark optimiztaion


Mathematics Subject Classification ID

Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)



Related Items (1)

Recent Advances in Constraints






This page was built for publication: Some polynomial programming problems solving with a clustering algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714177)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2714177&oldid=15566937"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 12:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki