Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Methods for Mathematical Programming Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132250 / 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: Practical Solution of Large Mixed Integer Programming Problems with Umpire / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System / 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: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial invariant for knots via von Neumann algebras / 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: Integer Programming with a Fixed Number of Variables / 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: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 11:58, 25 June 2024

scientific article
Language Label Description Also known as
English
Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information
scientific article

    Statements

    Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete optimization
    0 references
    Branch and Bound
    0 references
    0 references