EconPapers    
Economics at your fingertips  
 

Details about Egon Balas

This author is deceased (2019-03-18).

Access statistics for papers by Egon Balas.

Last updated 2023-02-17. Update your information in the RePEc Author Service.

Short-id: pba1664


Jump to Journal Articles Chapters

Working Papers

2004

  1. On unions and dominants of polytopes
    LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Downloads View citations (3)
    Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2002) Downloads

1989

  1. A LIFTING PROCEDURE FOR THE ASYMMETRIC TRAVELING SALEMAN POLYTOPE AND A LARGE NEW CLASS OF FACETS
    GSIA Working Papers, Carnegie Mellon University, Tepper School of Business
  2. A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM
    GSIA Working Papers, Carnegie Mellon University, Tepper School of Business
  3. MINIMUM WEIGHTED COLORING OF TRIANGULATED GRAPHS, WITH APPLICATION TO WEIGHTED VERTEX PACKING IN ARBITRARY GRAPHS
    GSIA Working Papers, Carnegie Mellon University, Tepper School of Business

1988

  1. AN ALGORITHM FOR THE THREE-INDEX ASSIGNMENT PROBLEM
    GSIA Working Papers, Carnegie Mellon University, Tepper School of Business
    See also Journal Article in Operations Research (1991)
  2. THE FIXED-OUTDEGREE 1-ARBORESCENCE POLYTOPE
    GSIA Working Papers, Carnegie Mellon University, Tepper School of Business

Journal Articles

2020

  1. When Lift-and-Project Cuts Are Different
    INFORMS Journal on Computing, 2020, 32, (3), 822-834 Downloads

2011

  1. Projecting systems of linear inequalities with binary variables
    Annals of Operations Research, 2011, 188, (1), 19-31 Downloads View citations (1)

2007

  1. Some thoughts on the development of integer programming during my research career
    Annals of Operations Research, 2007, 149, (1), 19-26 Downloads

2005

  1. Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
    Annals of Operations Research, 2005, 140, (1), 125-161 Downloads View citations (10)

2004

  1. Logical Constraints as Cardinality Rules: Tight Representation
    Journal of Combinatorial Optimization, 2004, 8, (2), 115-128 Downloads View citations (1)

2002

  1. 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, 2002, 141, (1), 1-7 Downloads View citations (1)

2001

  1. Octane: A New Heuristic for Pure 0--1 Programs
    Operations Research, 2001, 49, (2), 207-225 Downloads View citations (8)

1999

  1. New classes of efficiently solvable generalized Traveling Salesman Problems
    Annals of Operations Research, 1999, 86, 529-558 Downloads View citations (16)

1998

  1. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
    Management Science, 1998, 44, (2), 262-275 Downloads View citations (29)
  2. Job Shop Scheduling With Deadlines
    Journal of Combinatorial Optimization, 1998, 1, (4), 329-353 Downloads View citations (2)

1996

  1. A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
    Operations Research, 1996, 44, (6), 875-890 Downloads View citations (23)
  2. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
    Management Science, 1996, 42, (9), 1229-1246 Downloads View citations (32)

1995

  1. The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
    Management Science, 1995, 41, (1), 94-109 Downloads View citations (18)

1991

  1. An Algorithm for the Three-Index Assignment Problem
    Operations Research, 1991, 39, (1), 150-161 Downloads View citations (21)
    See also Working Paper (1988)

1988

  1. The Shifting Bottleneck Procedure for Job Shop Scheduling
    Management Science, 1988, 34, (3), 391-401 Downloads View citations (142)

1980

  1. An Algorithm for Large Zero-One Knapsack Problems
    Operations Research, 1980, 28, (5), 1130-1154 Downloads View citations (57)
  2. Pivot and Complement--A Heuristic for 0-1 Programming
    Management Science, 1980, 26, (1), 86-96 Downloads View citations (28)
  3. Strengthening cuts for mixed integer programs
    European Journal of Operational Research, 1980, 4, (4), 224-234 Downloads View citations (14)

1977

  1. A node covering algorithm
    Naval Research Logistics Quarterly, 1977, 24, (2), 213-233 Downloads

1975

  1. Intersection cuts from outer polars of truncated cubes
    Naval Research Logistics Quarterly, 1975, 22, (3), 477-496 Downloads
  2. On the Set-Covering Problem: II. An Algorithm for Set Partitioning
    Operations Research, 1975, 23, (1), 74-90 Downloads View citations (10)

1973

  1. Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case
    Operations Research, 1973, 21, (1), 321-322 Downloads

1972

  1. On the Set-Covering Problem
    Operations Research, 1972, 20, (6), 1152-1161 Downloads View citations (14)

1971

  1. An Intersection Cut from the Dual of the Unit Hypercube
    Operations Research, 1971, 19, (1), 40-44 Downloads View citations (1)
  2. Intersection Cuts—A New Type of Cutting Planes for Integer Programming
    Operations Research, 1971, 19, (1), 19-39 Downloads View citations (30)

1970

  1. Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs
    Naval Research Logistics Quarterly, 1970, 17, (1), 1-10 Downloads

1969

  1. Duality in Discrete Programming: II. The Quadratic Case
    Management Science, 1969, 16, (1), 14-32 Downloads View citations (1)
  2. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
    Operations Research, 1969, 17, (6), 941-957 Downloads View citations (38)

1968

  1. Errata
    Operations Research, 1968, 16, (4), 886-886 Downloads
  2. Letter to the Editor—A Note on the Branch-and-Bound Principle
    Operations Research, 1968, 16, (2), 442-445 Downloads View citations (1)

1967

  1. Discrete Programming by the Filter Method
    Operations Research, 1967, 15, (5), 915-957 Downloads View citations (8)

1966

  1. An Infeasibility-Pricing Decomposition Method for Linear Programs
    Operations Research, 1966, 14, (5), 847-873 Downloads View citations (1)
  2. Letter to the Editor—Comments on the Preceding Note
    Operations Research, 1966, 14, (5), 942-942 Downloads
  3. The Dual Method for the Generalized Transportation Problem
    Management Science, 1966, 12, (7), 555-568 Downloads View citations (3)

1965

  1. An Additive Algorithm for Solving Linear Programs with Zero-One Variables
    Operations Research, 1965, 13, (4), 517-546 Downloads View citations (34)
  2. Solution of Large-Scale Transportation Problems Through Aggregation
    Operations Research, 1965, 13, (1), 82-93 Downloads View citations (1)

1964

  1. On the Generalized Transportation Problem
    Management Science, 1964, 11, (1), 188-202 Downloads View citations (4)

Chapters

2007

  1. On the Cycle Polytope of a Directed Graph and Its Relaxations
    Springer
 
Page updated 2024-02-24