John W. Chinneck An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1996, v:17, n:1-2, pp:127-144 [Journal]
John W. Chinneck Fast Heuristics for the Maximum Feasible Subsystem Problem. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2001, v:13, n:3, pp:210-223 [Journal]
John W. Chinneck From the Guest Editor: Special Issue on the Merging of Mathematical Programming and Constraint Programming. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2002, v:14, n:4, pp:293-294 [Journal]
John W. Chinneck The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2004, v:16, n:3, pp:255-265 [Journal]
John W. Chinneck Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 1997, v:9, n:2, pp:164-174 [Journal]