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

A sequential aggregation algorithm for the set partitioning problem

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

DOI10.1016/0045-7825(87)90070-3zbMath0613.65065OpenAlexW2034860708MaRDI QIDQ1819547

A. A. Nouh

Publication date: 1987

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(87)90070-3


zbMATH Keywords

convergencecost minimum set partitioning problemgradient search algorithmzero-one integer program


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)




Cites Work

  • A search algorithm for the minimum cost covering of 0-1 integers sets
  • Application of 0-1 integer programming to multitarget tracking problems
  • Unnamed Item
  • Unnamed Item




This page was built for publication: A sequential aggregation algorithm for the set partitioning problem

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