John W. Chinneck

From MaRDI portal
Person:237902

Available identifiers

zbMath Open chinneck.john-wMaRDI QIDQ237902

List of research outcomes





PublicationDate of PublicationType
The maximum feasible subset problem (maxFS) and applications2023-03-20Paper
Harvey Greenberg: analyzing infeasible mathematical programs2022-10-25Paper
Faster maximum feasible subsystem solutions for dense constraint matrices2022-03-09Paper
Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices2021-02-10Paper
Accurate and Efficient Estimation of Logic Circuits Reliability Bounds2017-05-16Paper
Achieving MILP feasibility quickly using general disjunctions2016-11-10Paper
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks2016-10-07Paper
Improved constraint consensus methods for seeking feasibility in nonlinear programs2013-06-28Paper
Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes2013-05-30Paper
The constraint consensus method for finding approximately feasible points in nonlinear programs2012-06-08Paper
Fast heuristics for the maximum feasible subsystem problem2012-05-30Paper
Faster integer-feasibility in mixed-integer linear programs by branching to force change2011-03-25Paper
Active-constraint variable ordering for faster feasibility of mixed integer linear programs2010-07-21Paper
Faster MIP solutions via new node selection rules2010-03-18Paper
Feasibility and infeasibility in optimization. Algorithms and computational methods.2008-02-27Paper
Improving solver success in reaching feasibility for sets of nonlinear constraints2007-11-06Paper
Assigning service requests in voice-over-internet gateway multiprocessors2004-11-18Paper
A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications2003-05-14Paper
Analyzing mathematical programs using MProbe2002-03-26Paper
Discovering the Characteristics of Mathematical Programs via Sampling2002-01-01Paper
Analyzing Infeasible Mixed-Integer and Integer Linear Programs1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43954231998-08-04Paper
Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program1998-05-03Paper
An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem1998-03-04Paper
Formulation assistance for global optimization problems1997-11-06Paper
Localizing and Diagnosing Infeasibilities in Networks1996-10-28Paper
Computer Codes for the Analysis of Infeasible Linear Programs1996-08-06Paper
https://portal.mardi4nfdi.de/entity/Q48873351996-08-01Paper
Analyzing infeasible nonlinear programs1995-06-11Paper
MINOS(IIS): Infeasibility analysis using MINOS1994-03-24Paper
Locating Minimal Infeasible Constraint Sets in Linear Programs1993-02-18Paper
https://portal.mardi4nfdi.de/entity/Q40058631992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q47126711992-06-25Paper

Research outcomes over time

This page was built for person: John W. Chinneck