Extracting embedded generalized networks from linear programming problems (Q3693261): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1379766
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Richard D. McBride / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good submatrix is hard to find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Generalized Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic identification of embedded network rows in large-scale optimization models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex SON algorithm for LP/embedded network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization approach to large-scale linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01585656 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003455391 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article
Language Label Description Also known as
English
Extracting embedded generalized networks from linear programming problems
scientific article

    Statements

    Extracting embedded generalized networks from linear programming problems (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    basis factorization
    0 references
    computational complexity
    0 references
    heuristic algorithms
    0 references
    generalized networks
    0 references
    NP-complete
    0 references
    approximate solutions
    0 references
    Computational experience
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references