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

A comparison of optimization methods for multi-objective constrained bin packing problems

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

DOI10.1007/978-3-319-93031-2_33OpenAlexW2805328190MaRDI QIDQ1626770

Gilles Pesant, Andrea Lodi, Philippe Olivier

Publication date: 21 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_33


zbMATH Keywords

pairwise conflicts, load balancing


Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items (1)

The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints







This page was built for publication: A comparison of optimization methods for multi-objective constrained bin packing problems

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