John W. Chinneck

Available identifiers

zbMath Open chinneck.john-wMaRDI QIDQ237902

List of research outcomes

Publication	Date of Publication	Type
The maximum feasible subset problem (maxFS) and applications	2023-03-20	Paper
Harvey Greenberg: analyzing infeasible mathematical programs	2022-10-25	Paper
Faster maximum feasible subsystem solutions for dense constraint matrices	2022-03-09	Paper
Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices	2021-02-10	Paper
Accurate and Efficient Estimation of Logic Circuits Reliability Bounds	2017-05-16	Paper
Achieving MILP feasibility quickly using general disjunctions	2016-11-10	Paper
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks	2016-10-07	Paper
Improved constraint consensus methods for seeking feasibility in nonlinear programs	2013-06-28	Paper
Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes	2013-05-30	Paper
The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs	2012-06-08	Paper
Fast Heuristics for the Maximum Feasible Subsystem Problem	2012-05-30	Paper
Faster integer-feasibility in mixed-integer linear programs by branching to force change	2011-03-25	Paper
Active-constraint variable ordering for faster feasibility of mixed integer linear programs	2010-07-21	Paper
Faster MIP solutions via new node selection rules	2010-03-18	Paper
Feasibility and infeasibility in optimization. Algorithms and computational methods.	2008-02-27	Paper
Improving solver success in reaching feasibility for sets of nonlinear constraints	2007-11-06	Paper
Assigning service requests in voice-over-internet gateway multiprocessors	2004-11-18	Paper
A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications	2003-05-14	Paper
Analyzing mathematical programs using MProbe	2002-03-26	Paper
Discovering the Characteristics of Mathematical Programs via Sampling	2002-01-01	Paper
Analyzing Infeasible Mixed-Integer and Integer Linear Programs	1999-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4395423	1998-08-04	Paper
Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program	1998-05-03	Paper
An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem	1998-03-04	Paper
Formulation assistance for global optimization problems	1997-11-06	Paper
Localizing and Diagnosing Infeasibilities in Networks	1996-10-28	Paper
Computer Codes for the Analysis of Infeasible Linear Programs	1996-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4887335	1996-08-01	Paper
Analyzing infeasible nonlinear programs	1995-06-11	Paper
MINOS(IIS): Infeasibility analysis using MINOS	1994-03-24	Paper
Locating Minimal Infeasible Constraint Sets in Linear Programs	1993-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4005863	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4712671	1992-06-25	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: John W. Chinneck