DASH: dynamic approach for switching heuristics (Q320816): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yuri Malitsky / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SATzilla / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATenstein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151159522 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.4689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow pack facets of the single node fixed-charge flow polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of the mixed-integer knapsack polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the lot-sizing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for problems with additive variable upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Value Heuristics for Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning dynamic algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: General Formulation and Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-constraint variable ordering for faster feasibility of mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for dynamically adapting propagation in constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624141 / rank
 
Normal rank

Latest revision as of 15:57, 12 July 2024

scientific article
Language Label Description Also known as
English
DASH: dynamic approach for switching heuristics
scientific article

    Statements

    DASH: dynamic approach for switching heuristics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    mixed-integer programming
    0 references
    algorithm selection
    0 references
    dynamic search heuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers