\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On finding the optimal BDD relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Bounds from Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision diagrams for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Optimization with Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivalued Decision Diagrams for Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assortment optimization over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienteering problem: a survey of recent variants, solution approaches and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of variants and extensions of the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Diagrams and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid optimization methods for time-dependent sequencing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search framework for compiling relaxed decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing jobs that require common resources on a single machine: A solvable case of the TSP / rank
 
Normal rank

Latest revision as of 19:26, 25 July 2024

scientific article
Language Label Description Also known as
English
\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
scientific article

    Statements

    \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2021
    0 references
    decision diagrams
    0 references
    \( \mathrm{A}^*\) search
    0 references
    scheduling
    0 references
    sequencing
    0 references
    0 references
    0 references
    0 references

    Identifiers