Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 6459535

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

zbMATH Open1316.91018MaRDI QIDQ5262858FDOQ5262858

Bogusz Przybyslawski, Adam Kasperski

Publication date: 16 July 2015



Title of this publication is not available (Why is that?)


zbMATH Keywords

approximation algorithmsresource allocationrobust optimizationdiscrete optimization


Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Semidefinite programming (90C22)



Cited In (7)

  • Title not available (Why is that?)
  • Faster min-max resource sharing in theory and practice
  • A Max-Min Allocation Problem: Its Solutions and Applications
  • POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
  • Technical Note—On Min-Max Integer Allocation Problems
  • Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
  • An approximate solution to the linear problem of minimizing resource consumption






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262858)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5262858&oldid=19898429"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 20:11. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki