Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093995619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling algorithm for the constrained maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the location of minisum facilities through network modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck Capacity Expansion Problems with General Budget Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying edges of a network to obtain short subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution techniques for some allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit-time tasks with integer release times and deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum source-sink path subject to a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph traversals, genes and matroids: An efficient case of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Budgeted Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Algorithm for the Optimal Distribution of Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Load Factors in Two-Processor Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 12:28, 24 June 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for robustness in resource allocation and scheduling problems
scientific article

    Statements

    Efficient algorithms for robustness in resource allocation and scheduling problems (English)
    0 references
    0 references
    0 references
    24 March 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    robustness
    0 references
    optimization
    0 references
    scheduling
    0 references
    partition matroid
    0 references
    0 references