„Balas Egon” változatai közötti eltérés
| [ellenőrzött változat] | [ellenőrzött változat] |
Tartalom törölve Tartalom hozzáadva
a r2.7.3) (Bot: következő hozzáadása: de:Egon Balas |
→Munkássága: cikkeiből |
||
23. sor:
* ''Integer Programming and Combinatorial Optimization: 4th International IPCO Conference'', Copenhagen, Denmark, May 29-31, 1995 Proceedings (Ed. Egon Balas, Jens Clausen)
* ''50 Years of Integer Programming 1958–2008'', Part 1, 283-340 ''Disjunctive Programming'', Springer, 2010.
* ''Will to freedom: A Perilous Journey through Fascism and Communism'', Syracuse University Press, 2000 (megjelent magyarul, franciául, németül is)
===Cikkei (válogatás)===
*E. Balas, A. Saxena: Optimizing Over the Split Closure, ''Mathematical Programming'' 113, 2 (2008), 219–240.
*E. Balas, M. Perregaard: A Precise Correspondence Between Lift-and-Project Cuts, Simple Disjunctive Cuts, and Mixed Integer Gomory Cuts for 0-1 Programming, ''Mathematical Programming'' B (94), 2003; 221–245.
*E. Balas, S. Ceria, G. Cornuéjols: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework, ''Management Science'' 42, 1996; 1229–1246.
*E. Balas: The Prize Collecting Traveling Salesman Problem: II Polyhedad Results, ''Networks'' 25, 1995; 199–216.
*E. Balas, S. Ceria, G. Cornuéjols: A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs, ''Mathematical Programming'' 58, 1993; 295–324.
*E. Balas: The Prize Collecting Traveling Salesman Problem I, ''Networks'' 19, 1989; 621–636.
*E. Balas, J. Adams, D. Zawack: The Shifting Bottleneck Procedure for Job Shop Scheduling, ''Management Science'' 34, 1988; 391–401.
*E. Balas, V. Chivatal, J. Nesetril: On The Maximum-Weight Clique Problem, ''Mathematics of Operations Research'' 12, 1987; 522–536.
*E. Balas: Disjunctive Programming, ''Annals of Discrete Mathematics'' 5, 1979; 3–51.
*E. Balas: An Additive Algorithm for Linear Programming in Zero-One Variables, ''Operations Research'' 13 (4), 1965; 517–546.
===Díjai===
| |||