Mixed integer programming: A historical perspective with Xpress-MP (Q537574): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
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.1007/s10479-006-0092-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005207427 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61013131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Lessons in Solving Practical Integer Programs / 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: Local branching / 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: Updated triangular factors of the basis to maintain sparsity in the product form simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: General purpose heuristics for integer programming. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: General purpose heuristics for integer programming. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-sparsity in the revised simplex method and how to exploit it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3157361 / 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: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On free variables in interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints / rank
 
Normal rank

Latest revision as of 02:39, 4 July 2024

scientific article
Language Label Description Also known as
English
Mixed integer programming: A historical perspective with Xpress-MP
scientific article

    Statements

    Mixed integer programming: A historical perspective with Xpress-MP (English)
    0 references
    0 references
    20 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references