Aggregation of equalities in integer programming
作者： G. Plateau , M. T. Guerch
DOI: 10.1007/BFB0008890
关键词:
摘要:
springer.com
sci-hub.se 参考文章(14)
Fred Glover, Robert E. D. Woolsey, Aggregating diophantine equations Zeitschrift für Operations Research. ,vol. 16, pp. 1- 10 ,(1972) , 10.1007/BF01917186
Gordon H. Bradley, Transformation of integer programs to knapsack problems Discrete Mathematics. ,vol. 1, pp. 29- 45 ,(1971) , 10.1016/0012-365X(71)90005-7
I.G. Rosenberg, Aggregation of equations in integer programming Discrete Mathematics. ,vol. 10, pp. 325- 341 ,(1974) , 10.1016/0012-365X(74)90126-5
Manfred W. Padberg, Equivalent knapsack-type formulations of bounded integer linear programs: An alternative approach Naval Research Logistics Quarterly. ,vol. 19, pp. 699- 708 ,(1972) , 10.1002/NAV.3800190410
Kenneth E. Kendall, Stanley Zionts, Technical Note-Solving Integer Programming Problems by Aggregating Constraints Operations Research. ,vol. 25, pp. 346- 351 ,(1977) , 10.1287/OPRE.25.2.346
R.R Meyer, Equivalent Constraints for Discrete Sets. Discrete Applied Mathematics. ,vol. 1, pp. 31- 50 ,(1979) , 10.1016/0166-218X(79)90013-1
On Systems of Linear Indeterminate Equations and Congruences Philosophical Transactions of the Royal Society. ,vol. 151, pp. 293- 326 ,(1861) , 10.1098/RSTL.1861.0016
Mohammed Tariq Guerch, La contraction d'équations diophantiennes Université des Sciences et Techniques de Lille - Flandres-Artois, Lille. ,(1983)
D. Fayard, G. Plateau, An algorithm for the solution of the 0–1 knapsack problem Computing. ,vol. 28, pp. 269- 287 ,(1982) , 10.1007/BF02241754
G. B. Mathews, On the Partition of Numbers Proceedings of the London Mathematical Society. ,vol. s1-28, pp. 486- 490 ,(1896) , 10.1112/PLMS/S1-28.1.486