Back to Results
First PageMeta Content
Operations research / Constraint programming / Convex optimization / Linear programming / Constraint / Algorithm / Active set / Candidate solution / Mathematical optimization / Mathematics / Applied mathematics


Fast Heuristics for the Maximum Feasible Subsystem Problem John W. Chinneck Systems and Computer Engineering, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada
Add to Reading List

Document Date: 2004-12-16 14:43:42


Open Document

File Size: 206,35 KB

Share Result on Facebook

Company

29 infeasible LP / infeasible LP / Feasible Subsystem Problem John W. Chinneck Systems / con- INFORMS Journal / /

Currency

USD / /

/

Facility

Netlib library / Carleton University / /

IndustryTerm

inherent non-polynomial algorithm / elastic solution / rst solution / speedier algorithm / identifies applications / applied algorithm / integer-programming algorithm / neural networks / maximum product / integer-programming solution / cover solution / homogeneous systems / parametric programming algorithm / /

OperatingSystem

Windows NT / Windows 95 / /

Organization

Artificial Intelligence / Carleton University / /

Person

Ryan / MAX FS / Parker / /

PublishedMedium

the INFORMS Journal / /

Technology

inherent non-polynomial algorithm / parametric programming algorithm / integer-programming algorithm / Polynomial Time Behavior Algorithm / 1 Algorithm / 2 Algorithm / the details of the algorithm / subsequently applied algorithm / machine learning / html / latter 5 algorithms / 2 Three Algorithms / speedier algorithm / /

URL

http /

SocialTag