Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RanGen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy concepts for network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: Notation, classification, models, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal procedures for the discrete time/cost trade-off problem in project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rangen: A random network generator for activity-on-the-node networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alarm placement in systems with fault propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact overall time distribution of a project with uncertain task durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of the restrictiveness of project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s1567-8326(03)00057-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980322379 / rank
 
Normal rank

Latest revision as of 11:04, 30 July 2024

scientific article
Language Label Description Also known as
English
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
scientific article

    Statements

    Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    Algorithms
    0 references
    Directed acyclic graph
    0 references
    Network generator
    0 references
    Constraint logic programming
    0 references
    Complexity index
    0 references
    0 references
    0 references

    Identifiers