A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1051/ro:2007021 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The load rebalancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of using small instance relaxations in parallel branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling File Transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced binary probabilities and the linear ordering polytope: A status report / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acyclic subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a resource-constrained scheduling problem with application to distributed systems reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of a resource-constrained scheduling problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/RO:2007021 / rank
 
Normal rank

Latest revision as of 08:11, 20 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for a resource-constrained scheduling problem
scientific article

    Statements

    A branch-and-cut algorithm for a resource-constrained scheduling problem (English)
    0 references
    0 references
    0 references
    1 June 2011
    0 references
    polyhedral combinatorics
    0 references
    scheduling
    0 references
    branch-and-cut
    0 references
    distributed systems
    0 references

    Identifiers

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