Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-006-0009-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Octane: A New Heuristic for Pure 0–1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and shift -- a mixed integer programming heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / 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: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / 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: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorial on surrogate constraint approaches for optimization in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Infeasible Mixed-Integer and Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming 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: Q4375771 / 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: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Branch-and-Bound Method for Integer Programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-006-0009-0 / rank
 
Normal rank

Latest revision as of 11:26, 10 December 2024

scientific article
Language Label Description Also known as
English
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
scientific article

    Statements

    Active-constraint variable ordering for faster feasibility of mixed integer linear programs (English)
    0 references
    0 references
    0 references
    21 July 2010
    0 references
    branching variable selection
    0 references
    MIP solver
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers