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

Bicriteria multiresource generalized assignment problem

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

DOI10.1002/nav.21607zbMath1411.90201OpenAlexW1499148489MaRDI QIDQ4632865

Özlem Karsu, Azizoglu, Meral

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/26404


zbMATH Keywords

heuristicsgeneralized assignment problembranch and boundlinear programming relaxation


Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)


Related Items (3)

Capturing preferences for inequality aversion in decision support ⋮ Fleet management: a vehicle and driver assignment model ⋮ An exact algorithm for the minimum squared load assignment problem




This page was built for publication: Bicriteria multiresource generalized assignment problem

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