Deep learning assisted heuristic tree search for the container pre-marshalling problem (Q2333140): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127314541, #quickstatements; #temporary_batch_1722437626092
 
(7 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Theano / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ASlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2970019720 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.09972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine Learning-Based Approximation of Strong Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASlib: a benchmark library for algorithm selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Decision Trees and Random Forests in Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search procedure for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Price Procedure for the Container Premarshalling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying the corridor method to a blocks relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search-based structured prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: DASH: dynamic approach for switching heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on: ``On learning and branching: a survey'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model agnostic solution of CSPs via deep learning: a preliminary study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches for heuristic search: A bilateral linkage with artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5270493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-heuristic approach for solving the pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chain methods for the bipartite Boolean quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Selection for Combinatorial Search Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning when to use a decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the abstraction method for the container relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization model for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning and branching: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical decision model learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the blocks relocation problem with new lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crew assignment via constraint programming: Integrating column generation and heuristic tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound approach for large pre-marshalling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating the branch-and-price algorithm using machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasibility-based heuristic for the container pre-marshalling problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127314541 / rank
 
Normal rank

Latest revision as of 16:00, 31 July 2024

scientific article
Language Label Description Also known as
English
Deep learning assisted heuristic tree search for the container pre-marshalling problem
scientific article

    Statements

    Deep learning assisted heuristic tree search for the container pre-marshalling problem (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2019
    0 references
    container pre-marshalling
    0 references
    tree search
    0 references
    deep learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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