Pages that link to "Item:Q490331"
From MaRDI portal
The following pages link to On the configuration-LP for scheduling on unrelated machines (Q490331):
Displaying 16 items.
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- (Q5075832) (← links)
- (Q5091233) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- (Q5116488) (← links)
- (Q5136271) (← links)
- Compact LP Relaxations for Allocation Problems (Q5240426) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
