Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
From MaRDI portal
Publication:4950820
DOI10.1287/opre.47.5.744zbMath0982.90023OpenAlexW2117135110MaRDI QIDQ4950820
Publication date: 27 April 2000
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.5.744
Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35)
Related Items (23)
An FPTAS for the parametric knapsack problem ⋮ A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows ⋮ A faster algorithm for computing the principal sequence of partitions of a graph ⋮ An approximation algorithm for a general class of parametric optimization problems ⋮ Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost ⋮ Complexity of source-sink monotone 2-parameter min cut ⋮ Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint ⋮ Refining the complexity of the sports elimination problem ⋮ A connection between sports and matroids: how many teams can we beat? ⋮ Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints ⋮ Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach ⋮ Approximation schemes for the parametric knapsack problem ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ A note on the parametric maximum flow problem and some related reoptimization issues ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Network flow approaches to pre-emptive open-shop scheduling problems with time-windows ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines ⋮ An FPTAS for the knapsack problem with parametric weights ⋮ Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times ⋮ An approximation algorithm for a general class of multi-parametric optimization problems ⋮ Ordered optimal solutions and parametric minimum cut problems
This page was built for publication: Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
