Pages that link to "Item:Q4950820"
From MaRDI portal
The following pages link to Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow (Q4950820):
Displaying 25 items.
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
- A note on the parametric maximum flow problem and some related reoptimization issues (Q2480211) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- Ordered optimal solutions and parametric minimum cut problems (Q2568331) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- Universally maximum flow with piecewise-constant capacities (Q2764994) (← links)
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
- (Q4228485) (← links)
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
- A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times (Q6547139) (← links)
