Optimal interval scheduling with a resource constraint (Q337149): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650718 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed job scheduling
Property / zbMATH Keywords: fixed job scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
resource allocation
Property / zbMATH Keywords: resource allocation / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
branch and price
Property / zbMATH Keywords: branch and price / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972086438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of interval scheduling with a resource constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solutions for routing problems with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic approximation for unsplittable flow on line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Temporal Knapsack Problem and Its Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling on identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful Mechanisms via Greedy Iterative Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource allocation with time intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Resources for Fixed and Variable Job Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution for the Channel-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation based Primal Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (maximum) class scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for the operational fixed interval scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780409 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:48, 12 July 2024

scientific article
Language Label Description Also known as
English
Optimal interval scheduling with a resource constraint
scientific article

    Statements

    Optimal interval scheduling with a resource constraint (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    scheduling
    0 references
    fixed job scheduling
    0 references
    resource allocation
    0 references
    complexity
    0 references
    branch and price
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers