IDEAS home Printed from https://ideas.repec.org/f/pba1664.html
   My authors  Follow this author

Egon Balas

(deceased)

Personal Details

This person is deceased (Date: 18 Mar 2019)
First Name:Egon
Middle Name:
Last Name:Balas
Suffix:
RePEc Short-ID:pba1664
Terminal Degree:1967 Solvay Brussels School of Economics and Management; Université Libre de Bruxelles (from RePEc Genealogy)

Research output

as
Jump to: Working papers Articles Chapters

Working papers

  1. BALAS, Egon & BOCKMAYR, Alexander & PISARUK, Nicolai & WOLSEY, Laurence, 2002. "On unions and dominants of polytopes," LIDAM Discussion Papers CORE 2002008, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  2. Balas, E. & Fischetti, M., 1989. "A Lifting Procedure For The Asymmetric Traveling Saleman Polytope And A Large New Class Of Facets," GSIA Working Papers 88-89-83, Carnegie Mellon University, Tepper School of Business.
  3. Balas, E. & Xue, J., 1989. "Minimum Weighted Coloring Of Triangulated Graphs, With Application To Weighted Vertex Packing In Arbitrary Graphs," GSIA Working Papers 88-89-55, Carnegie Mellon University, Tepper School of Business.
  4. Balas, E. & Miller, D. & Pekny, J. & Toth, P., 1989. "A Parallel Shortest Path Algorithm For The Assignment Problem," GSIA Working Papers 88-89-49, Carnegie Mellon University, Tepper School of Business.
  5. Balas, E. & Fischetti, M., 1988. "The Fixed-Outdegree 1-Arborescence Polytope," GSIA Working Papers 88-89-26, Carnegie Mellon University, Tepper School of Business.
  6. Balas, E. & Saltzman, M.J., 1988. "An Algorithm For The Three-Index Assignment Problem," GSIA Working Papers 88-89-23, Carnegie Mellon University, Tepper School of Business.

Articles

  1. Egon Balas & Thiago Serra, 2020. "When Lift-and-Project Cuts Are Different," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 822-834, July.
  2. Egon Balas, 2011. "Projecting systems of linear inequalities with binary variables," Annals of Operations Research, Springer, vol. 188(1), pages 19-31, August.
  3. Egon Balas, 2007. "Some thoughts on the development of integer programming during my research career," Annals of Operations Research, Springer, vol. 149(1), pages 19-26, February.
  4. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.
  5. Egon Balas, 2004. "Logical Constraints as Cardinality Rules: Tight Representation," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 115-128, June.
  6. Balas, Egon, 2002. "Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam," European Journal of Operational Research, Elsevier, vol. 141(1), pages 1-7, August.
  7. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
  8. E. Balas, 1999. "New classes of efficiently solvable generalized Traveling Salesman Problems," Annals of Operations Research, Springer, vol. 86(0), pages 529-558, January.
  9. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.
  10. Egon Balas & Giuseppe Lancia & Paolo Serafini & Alkiviadis Vazacopoulos, 1998. "Job Shop Scheduling With Deadlines," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 329-353, December.
  11. Egon Balas & Sebastián Ceria & Gérard Cornuéjols, 1996. "Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework," Management Science, INFORMS, vol. 42(9), pages 1229-1246, September.
  12. Egon Balas & Maria C. Carrera, 1996. "A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering," Operations Research, INFORMS, vol. 44(6), pages 875-890, December.
  13. Egon Balas & Jan Karel Lenstra & Alkis Vazacopoulos, 1995. "The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling," Management Science, INFORMS, vol. 41(1), pages 94-109, January.
  14. Egon Balas & Matthew J. Saltzman, 1991. "An Algorithm for the Three-Index Assignment Problem," Operations Research, INFORMS, vol. 39(1), pages 150-161, February.
  15. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
  16. Balas, Egon & Jeroslow, Robert G., 1980. "Strengthening cuts for mixed integer programs," European Journal of Operational Research, Elsevier, vol. 4(4), pages 224-234, April.
  17. Egon Balas & Clarence H. Martin, 1980. "Pivot and Complement--A Heuristic for 0-1 Programming," Management Science, INFORMS, vol. 26(1), pages 86-96, January.
  18. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.
  19. Egon Balas & Haakon Samuelsson, 1977. "A node covering algorithm," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(2), pages 213-233, June.
  20. Egon Balas & Manfred Padberg, 1975. "On the Set-Covering Problem: II. An Algorithm for Set Partitioning," Operations Research, INFORMS, vol. 23(1), pages 74-90, February.
  21. Egon Balas & Andris Zoltners, 1975. "Intersection cuts from outer polars of truncated cubes," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(3), pages 477-496, September.
  22. Egon Balas, 1973. "Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case," Operations Research, INFORMS, vol. 21(1), pages 321-322, February.
  23. Egon Balas & Manfred W. Padberg, 1972. "On the Set-Covering Problem," Operations Research, INFORMS, vol. 20(6), pages 1152-1161, December.
  24. Egon Balas & V. Joseph Bowman & Fred Glover & David Sommer, 1971. "An Intersection Cut from the Dual of the Unit Hypercube," Operations Research, INFORMS, vol. 19(1), pages 40-44, February.
  25. Egon Balas, 1971. "Intersection Cuts—A New Type of Cutting Planes for Integer Programming," Operations Research, INFORMS, vol. 19(1), pages 19-39, February.
  26. Egon Balas, 1970. "Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 17(1), pages 1-10, March.
  27. Egon Balas, 1969. "Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm," Operations Research, INFORMS, vol. 17(6), pages 941-957, December.
  28. Egon Balas, 1969. "Duality in Discrete Programming: II. The Quadratic Case," Management Science, INFORMS, vol. 16(1), pages 14-32, September.
  29. Egon Balas, 1968. "Letter to the Editor—A Note on the Branch-and-Bound Principle," Operations Research, INFORMS, vol. 16(2), pages 442-445, April.
  30. Egon Balas, 1968. "Errata," Operations Research, INFORMS, vol. 16(4), pages 886-886, August.
  31. Egon Balas, 1967. "Discrete Programming by the Filter Method," Operations Research, INFORMS, vol. 15(5), pages 915-957, October.
  32. Egon Balas, 1966. "An Infeasibility-Pricing Decomposition Method for Linear Programs," Operations Research, INFORMS, vol. 14(5), pages 847-873, October.
  33. Egon Balas, 1966. "Letter to the Editor—Comments on the Preceding Note," Operations Research, INFORMS, vol. 14(5), pages 942-942, October.
  34. Egon Balas, 1966. "The Dual Method for the Generalized Transportation Problem," Management Science, INFORMS, vol. 12(7), pages 555-568, March.
  35. Egon Balas, 1965. "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Operations Research, INFORMS, vol. 13(4), pages 517-546, August.
  36. Egon Balas, 1965. "Solution of Large-Scale Transportation Problems Through Aggregation," Operations Research, INFORMS, vol. 13(1), pages 82-93, February.
  37. E. Balas & P. L. Ivanescu, 1964. "On the Generalized Transportation Problem," Management Science, INFORMS, vol. 11(1), pages 188-202, September.
    RePEc:inm:ormoor:v:17:y:1992:i:4:p:1001-1018 is not listed on IDEAS
    RePEc:inm:ormoor:v:23:y:1998:i:4:p:1022-1022 is not listed on IDEAS
    RePEc:inm:ormoor:v:24:y:1999:i:2:p:273-292 is not listed on IDEAS
    RePEc:inm:ormoor:v:2:y:1977:i:1:p:15-19 is not listed on IDEAS
    RePEc:inm:ormoor:v:12:y:1987:i:3:p:522-535 is not listed on IDEAS
    RePEc:inm:ormoor:v:9:y:1984:i:1:p:1-5 is not listed on IDEAS
    RePEc:inm:orijoc:v:25:y:2013:i:3:p:475-487 is not listed on IDEAS
    RePEc:inm:orijoc:v:13:y:2001:i:1:p:56-75 is not listed on IDEAS

Chapters

  1. Egon Balas & Rüdiger Stephan, 2007. "On the Cycle Polytope of a Directed Graph and Its Relaxations," Operations Research Proceedings, in: Karl-Heinz Waldmann & Ulrike M. Stocker (ed.), Operations Research Proceedings 2006, pages 203-208, Springer.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Rankings

This author is among the top 5% authors according to these criteria:
  1. Number of Journal Pages, Weighted by Number of Authors

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Egon Balas should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.