On Submodular Search and Machine Scheduling (Q5108249): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single Machine Job Sequencing with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating search at two locations / 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: Searching a Variable Speed Network / 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: On the Approximability of Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Long Code Test with One Free Bit / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local-global conjecture for scheduling with non-linear cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / 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: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐Armed Bandit Allocation Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Linear Ordering Problems / 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: Search Games with Multiple Hidden Objects / 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: A Periodic Optimal Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Techniques for Scheduling on a Machine with Varying Speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The boundaries of submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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: Min-Sum Scheduling Under Precedence Constraints / 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: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing Speed Scheduling and Flow Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of searching an immobile hider in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2999661 / rank
 
Normal rank

Latest revision as of 13:13, 22 July 2024

scientific article; zbMATH DE number 7195306
Language Label Description Also known as
English
On Submodular Search and Machine Scheduling
scientific article; zbMATH DE number 7195306

    Statements

    On Submodular Search and Machine Scheduling (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    search games
    0 references
    scheduling
    0 references
    game theory
    0 references
    submodular functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references