• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints.

Searidang PaRajmohan RajaramanDavid Stalfa
Published in: APOCS (2022)
Keyphrases
  • capacity constraints
  • network flow
  • lagrangian relaxation
  • upper bound
  • lower and upper bounds
  • single item
  • minimum cost
  • bicriteria
  • lower bound
  • scheduling problem
  • linear programming
  • resource allocation