Faster MIP solutions via new node selection rules (Q2270439): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.11.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050721868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer-programming software systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Solution of Large Mixed Integer Programming Problems with Umpire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming using pseudo-costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Programming / 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: Investigation of some branch and bound strategies for the solution of mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-constraint variable ordering for faster feasibility of mixed integer linear programs / rank
 
Normal rank

Latest revision as of 14:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Faster MIP solutions via new node selection rules
scientific article

    Statements

    Faster MIP solutions via new node selection rules (English)
    0 references
    0 references
    0 references
    18 March 2010
    0 references
    0 references
    mixed-integer programming
    0 references
    node selection rules
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references