John W. Chinneck,Erik W. Dravnieks.Locating Minimal Infeasible Constraint Sets in Linear Programs[J].ORSA Journal on Computing,1991(2).
M. W. P. Savelsbergh.Preprocessing and Probing Techniques for Mixed Integer Programming Problems[J].ORSA Journal on Computing,1994(4).
Yongpei Guan,Kai Pan,Kezhuo Zhou.Polynomial time algorithms and extended formulations for unit commitment problems[J].IISE Transactions,2018(8).
Youcef Sahraoui,Pascale Bendotti,Claudia D'Ambrosio.Real-world hydro-power unit-commitment: Dealing with numerical errors and feasibility issues[J].Energy,2019.
John W. Chinneck.Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program[J].INFORMS Journal on Computing,1997(2).
Olivier Guieu,John W. Chinneck.Analyzing Infeasible Mixed-Integer and Integer Linear Programs[J].INFORMS Journal on Computing,1999(1).
John Gleeson,Jennifer Ryan.Identifying Minimally Infeasible Subsystems of Inequalities[J].ORSA Journal on Computing,1990(1).
John W. Chinneck.Analyzing infeasible nonlinear programs[J].Computational Optimization and Applications,1995(2).
Mark Parker,Jennifer Ryan.Finding the minimum weight IIS cover of an infeasible system of linear inequalities[J].Annals of Mathematics and Artificial Intelligence,1996(1).
Bo Li,Chunjie Qin,Ruotao Yu,Wei Dai,Mengjun Shen,Ziming Ma,Jianxiao Wang.Fast Solution Method for the Large-scale Unit Commitment Problem with Long-term Storage[J].Chinese Journal of Electrical Engineering,2023(03).