The following pages link to Real-time scheduling with a budget (Q878439):
Displaying 6 items.
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
