Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Less is more: tabu search for Bipartite Qudratic Programming problem

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

DOI10.1007/978-3-030-22629-9_27zbMath1444.90104OpenAlexW2950233525MaRDI QIDQ2181776

Zhazira Amirgaliyeva, Dragan Urošević, Yiad Ibrahim Yousef Alghoul, Nenad Mladenović

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_27

zbMATH Keywords

tabu searchgraphsvariable neighborhood searchdiscrete optimizationbipartite quadratic programming


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Combinatorial optimization (90C27)


Related Items

The Bipartite QUBO



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2181776&oldid=14704693"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 02:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki