A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hong-Wei Liu / rank
Normal rank
 
Property / author
 
Property / author: Hong-Wei Liu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C51 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6592835 / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming
Property / zbMATH Keywords: linear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
infeasible-interior-point method
Property / zbMATH Keywords: infeasible-interior-point method / rank
 
Normal rank
Property / zbMATH Keywords
 
arc-search
Property / zbMATH Keywords: arc-search / rank
 
Normal rank
Property / zbMATH Keywords
 
wide neighborhood
Property / zbMATH Keywords: wide neighborhood / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Netlib / 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/s12190-015-0900-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W609648197 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 02:06, 20 March 2024

scientific article
Language Label Description Also known as
English
A wide neighborhood infeasible-interior-point method with arc-search for linear programming
scientific article

    Statements

    A wide neighborhood infeasible-interior-point method with arc-search for linear programming (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    linear programming
    0 references
    infeasible-interior-point method
    0 references
    arc-search
    0 references
    wide neighborhood
    0 references
    complexity
    0 references

    Identifiers