Discrete Optimization with Decision Diagrams (Q2806864): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulating MDD Relaxations for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Bounds from Binary Decision Diagrams / 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: Decorous Lower Bounds for Minimum Linear Arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / 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: Randomized heuristics for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning Moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-Bounded Binary Decision Diagrams for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Continuous Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Diagrams and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An MDD Approach to Multidimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite bounding procedure for solving max-cut problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative and core-guided maxsat solving: a survey and assessment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank

Latest revision as of 00:03, 12 July 2024

scientific article
Language Label Description Also known as
English
Discrete Optimization with Decision Diagrams
scientific article

    Statements

    Discrete Optimization with Decision Diagrams (English)
    0 references
    19 May 2016
    0 references
    programming
    0 references
    integer
    0 references
    branch and bound
    0 references
    dynamic programming
    0 references
    deterministic
    0 references
    networks/graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references