Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Olvi L. Mangasarian / rank
Normal rank
 
Property / author
 
Property / author: Olvi L. Mangasarian / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / 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/s11590-008-0102-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160639883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear complementarity problem as a separable bilinear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of general linear complementarity problems via nondifferentiable concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-support solutions of polyhedral concave programs<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute value equation solution via concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute value equations / rank
 
Normal rank

Latest revision as of 16:53, 1 July 2024

scientific article
Language Label Description Also known as
English
Knapsack feasibility as an absolute value equation solvable by successive linear programming
scientific article

    Statements

    Knapsack feasibility as an absolute value equation solvable by successive linear programming (English)
    0 references
    17 June 2009
    0 references
    0 references
    knapsack feasibility
    0 references
    absolute value equations
    0 references
    successive linear programming
    0 references
    0 references
    0 references
    0 references