Hyper-sparsity in the revised simplex method and how to exploit it

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	259-283
Number of pages	25
Journal	Computational optimization and applications
Volume	32
Issue number	3
DOIs	https://doi.org/10.1007/s10589-005-4802-0
Publication status	Published - 2005

Access to Document

Best Paper Award
Hall, Julian (Recipient) & McKinnon, Kenneth (Recipient), 2005
Prize: Prize (including medals and awards)

@article{ca7dfce1a85b470dbe1a4015f473e432,

title = "Hyper-sparsity in the revised simplex method and how to exploit it",

author = "Julian Hall and Kenneth McKinnon",

year = "2005",

doi = "10.1007/s10589-005-4802-0",

language = "English",

volume = "32",

pages = "259--283",

journal = "Computational optimization and applications",

issn = "0926-6003",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Hyper-sparsity in the revised simplex method and how to exploit it

AU - Hall, Julian

AU - McKinnon, Kenneth

PY - 2005

Y1 - 2005

U2 - 10.1007/s10589-005-4802-0

DO - 10.1007/s10589-005-4802-0

M3 - Article

SN - 0926-6003

VL - 32

SP - 259

EP - 283

JO - Computational optimization and applications

JF - Computational optimization and applications

IS - 3

ER -