A General Framework for Approximating Min Sum Ordering Problems (Q5087715): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q513284
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2021.1124 / rank
Normal rank
 
Property / author
 
Property / author: Lisa Hellerstein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3015680468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing unreliable jobs on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining Coal or Finding Terrorists: The Expanding Search Paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine precedence constrained scheduling is a Vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple intents re-ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Color Sum of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic sums and distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query strategies for priced information (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min sum set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search value of a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Submodular Search and Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Tasks with AND/OR Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimal satisficing strategies for and-or trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence-constrained scheduling and min-sum set cover (extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Linear Ordering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of scheduling unit-time jobs with or-precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence-Constrained Min Sum Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Theory - ICDT 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The boundaries of submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential testing of complex systems: a review / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2021.1124 / rank
 
Normal rank

Latest revision as of 15:52, 30 December 2024

scientific article; zbMATH DE number 7552216
Language Label Description Also known as
English
A General Framework for Approximating Min Sum Ordering Problems
scientific article; zbMATH DE number 7552216

    Statements

    A General Framework for Approximating Min Sum Ordering Problems (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2022
    0 references
    scheduling
    0 references
    search theory
    0 references
    Boolean function evaluation
    0 references
    min sum set cover
    0 references
    approximation algorithms
    0 references
    0 references
    0 references

    Identifiers