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

scientific article

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

zbMath1242.90302MaRDI QIDQ2898516

Mohamed Maiza, Mohammed Said Radjef

Publication date: 11 July 2012

Full work available at URL: http://www.m-hikari.com/ams/ams-2011/ams-33-36-2011/index.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bin-packingmaximal cliqueconflicts graphmaximal-stablesubset


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items (7)

Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts ⋮ On the benchmark instances for the bin packing problem with conflicts






This page was built for publication:

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