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

Application of implicit enumeration to solve the packing problem

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

zbMath0820.90076MaRDI QIDQ1842413

V. A. Roshchin, Ivan V. Sergienko

Publication date: 17 May 1995

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)


zbMATH Keywords

packingpartition problemscomplete and partial covering problems


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)


Related Items (1)

Some directions and results of research in mathematical programming and system analysis







This page was built for publication: Application of implicit enumeration to solve the packing problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1842413&oldid=14219412"
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 10:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki