Large-scale 0-1 linear programming on distributed workstations (Q750295): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3939599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3273602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulation tool for the performance evaluation of parallel branch and bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3764631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity Cuts and Cut Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to parallelism in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anomalies in parallel branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of parallel branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: General branch and bound, and its relation to \(A^*\) and \(AO^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark on “an Inequality for the Number of Lattice Points in a Simplex” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering, Packing and Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut approach to a variant of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound and parallel computation: A historical note / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the speedup of parallel best-bound branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5635222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Linear Programming: A Study in Computational Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercylindrically Deduced Cuts in Zero-One Integer Programs / rank
 
Normal rank

Revision as of 11:32, 21 June 2024

scientific article
Language Label Description Also known as
English
Large-scale 0-1 linear programming on distributed workstations
scientific article

    Statements

    Large-scale 0-1 linear programming on distributed workstations (English)
    0 references
    0 references
    0 references
    1990
    0 references
    large-scale linear programming problems
    0 references
    branch-and-cut
    0 references
    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