|
T. Achterberg and R. Wunderling. 2013. “Mixed Integer Programming: Analyzing 12 Years of Progress”. Springer Berlin Heidelberg, Berlin, Heidelberg, 449-481.
|
|
T. Achterberg. “Constraint Integer Programming”. Ph.D. Dissertation. 2007.
|
|
T. Achterberg. “SCIP: Solving Constraint Integer Programs”. Mathematical Programming Computation, vol. 1, no.1, pp. 1-41, 2009.
|
|
J. H. Bai and S. X. Xing. “Study of Major Question of Wind Power Digestion and Transmission in China”. Power System and Clean Energy, vol. 26, no. 1, pp. 14-17, 2010.
|
|
CPLEX. Technical Report. IBM ILOG. http://www.ilog.com/products/cplex.
|
|
R. E. Gomory. “Outline of an Algorithm for Integer Solutions to Linear Programs”. Bull. Amer. Math. Soc, vol. 64, no. 5, pp. 275-279, 1958.
|
|
Z. H. Gu, G.L. Nemhauser, and M.W.P Savelsbergh. “Lifted Cover Inequalities for 0-1 Integer Programs: Computation”. INFORMS, pp. 427-437, 1998.
|
|
Z. H. Gu and G.L. Nemhauser. “Sequence Independent Lifting in Mixed Integer Programming”. Journal of Combinatorial Optimization, vol. 4, no.1, pp.109-129, 2000.
|
|
GUROBI. Optimizer. Technical Report. http://www.gurobi.com/.
|
|
X. Q. Han, S. G. Sun, and Q. R. Qi. “Evaluation of Wind Power Penetration Limit From Peak Regulation”. Electric Power, vol. 43, no.6, pp. 16-19, 2010.
|
|
L. A. Hemaspaandra and Ryan Williams. “SIGACT News Complexity Theory Column 76: An Atypical Survey of Typical-case Heuristic Algorithms”. SIGACT News, vol. 43, no. 4, pp. 70-89, 2012.
|
|
Y. Z. Lei. “Studies on Wind Farm Integration into Power System”. Automation of Electric Power Systems, vol. 27, no. 8, pp. 84-89, 2003.
|
|
L. Lov?sz. “On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics”, vol. 13, no. 4, pp. 383 -390, 1975.
|
|
S. J. Maher, T. Fischer, T. Gally, G. Gamrath, A. Gleixner, R. L. Gottwald, G. Hendel, T. Koch, M. E. L?bbecke, M. Miltenberger, B. M?ller, M.E. Pfetsch, C. Puchert, D. Rehfeldt, S. Schenker, R. Schwarz, F.Serrano, Y. Shinano, D. Weninger, J. T. Witt, and J. Witzig. “The SCIP Optimization Suite 4.0”. Technical Report 17-12. ZIB, Takustr.7, 14195 Berlin.
|
|
H. Mittelmann. “Mixed Integer Linear Programming Benchmark (Serial Codes)”. Technical Report. http://plato.asu.edu/ftp/milpf.html. 2017.
|
|
T. S. Motzkin and I. J. Schoenberg. 1954. “The Relaxation Method for Linear Inequalities”. Canadian Journal of Mathematics, vol. 6, pp. 393-404, 1954.
|
|
M. W. Padberg. “A Note on Zero-One Programming. Operations Research”, vol. 23, no.4, pp. 833-837. 1975.
|
|
M. W. Padberg. “(1,k)-Configurations and Facets for Packing Problems”. Mathematical Programming, vol. 18, no. 1, pp. 94-99, 1980.
|
|
Z. N Shi, Q. Jin, and J. R. Li. “Research on New Guideline of Distributed PV Connected to Grid”. China Electric Power (Technology Edition), vol. 6, pp. 69-72, 2010.
|
|
J. Wang, C. Liu, and Y.H. Huang. “Auto Tuning for New Energy Dispatch Problem: A Case Study”. Future Generation Computer Systems, vol. 54, pp. 501-506, 2015.
|
|
R. Weismantel.. “On the 0/1 knapsack polytope. Mathematical Programming”, vol. 77, no. 3, 49-68, 1997.
|
|
J. X. Yao and S.Q. Zhang. “Analysis on Capacity of Wind Power Integration into Grid based on Peak Load Regulation”. Advances of Power system and Hydroelectric Engineering, vol. 26, no. 7, pp. 25-28, 2010.
|
|
L. A. Wolsey. “Faces for a Linear Inequality in 0C1 Variables. Mathematical Programming”, vol. 8, pp. 165-178, 1975.
|