Access Statistics for Egon Balas

Author contact details at EconPapers.

Working Paper	File Downloads				Abstract Views
Working Paper	Last month	3 months	12 months	Total	Last month	3 months	12 months	Total
A LIFTING PROCEDURE FOR THE ASYMMETRIC TRAVELING SALEMAN POLYTOPE AND A LARGE NEW CLASS OF FACETS	0	0	0	0	0	1	8	432
A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM	0	0	0	0	0	1	1	1,033
AN ALGORITHM FOR THE THREE-INDEX ASSIGNMENT PROBLEM	0	0	0	2	1	2	10	528
MINIMUM WEIGHTED COLORING OF TRIANGULATED GRAPHS, WITH APPLICATION TO WEIGHTED VERTEX PACKING IN ARBITRARY GRAPHS	0	0	0	0	0	1	3	585
On unions and dominants of polytopes	0	0	0	0	0	1	2	7
On unions and dominants of polytopes	0	0	0	7	0	3	6	42
THE FIXED-OUTDEGREE 1-ARBORESCENCE POLYTOPE	0	0	0	0	0	1	6	282
Total Working Papers	0	0	0	9	1	10	36	2,909

Journal Article	File Downloads				Abstract Views
Journal Article	Last month	3 months	12 months	Total	Last month	3 months	12 months	Total
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering	0	0	2	22	0	5	31	91
A node covering algorithm	0	0	0	2	1	6	11	20
An Additive Algorithm for Solving Linear Programs with Zero-One Variables	1	7	15	105	2	16	48	300
An Algorithm for Large Zero-One Knapsack Problems	0	0	2	43	0	2	21	109
An Algorithm for the Three-Index Assignment Problem	0	2	3	11	2	7	14	35
An Infeasibility-Pricing Decomposition Method for Linear Programs	0	0	0	4	0	2	6	11
An Intersection Cut from the Dual of the Unit Hypercube	0	0	0	1	0	2	6	9
Discrete Programming by the Filter Method	1	2	4	8	1	3	12	21
Duality in Discrete Programming: II. The Quadratic Case	0	0	0	5	0	2	6	29
Errata	0	0	0	0	0	2	5	6
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling	0	1	1	34	0	4	16	117
Intersection Cuts—A New Type of Cutting Planes for Integer Programming	0	0	1	28	0	1	12	57
Intersection cuts from outer polars of truncated cubes	0	0	0	3	1	8	11	18
Job Shop Scheduling With Deadlines	0	0	0	0	0	2	6	19
Letter to the Editor—A Note on the Branch-and-Bound Principle	0	0	0	0	0	5	7	10
Letter to the Editor—Comments on the Preceding Note	0	0	0	0	0	0	2	4
Logical Constraints as Cardinality Rules: Tight Representation	0	0	0	0	0	1	6	12
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm	1	1	6	52	2	3	33	131
Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs	0	0	0	7	0	4	6	25
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework	0	0	0	28	0	3	20	100
New classes of efficiently solvable generalized Traveling Salesman Problems	0	0	0	11	0	2	17	56
Octane: A New Heuristic for Pure 0--1 Programs	0	0	0	3	0	1	5	14
On the Generalized Transportation Problem	0	0	0	12	1	1	7	49
On the Set-Covering Problem	1	1	5	15	1	2	13	30
On the Set-Covering Problem: II. An Algorithm for Set Partitioning	0	1	2	14	0	4	7	27
Pivot and Complement--A Heuristic for 0-1 Programming	0	0	1	12	1	2	14	69
Projecting systems of linear inequalities with binary variables	0	0	0	2	0	1	6	15
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization	0	1	1	11	0	3	8	44
Solution of Large-Scale Transportation Problems Through Aggregation	0	0	3	5	0	2	6	11
Some thoughts on the development of integer programming during my research career	0	0	0	2	0	0	2	9
Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam	0	0	0	12	0	0	2	37
Strengthening cuts for mixed integer programs	0	0	0	77	0	1	5	139
Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case	0	0	0	1	0	0	1	4
The Dual Method for the Generalized Transportation Problem	0	0	1	10	1	3	8	39
The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling	0	1	1	10	0	3	11	49
The Shifting Bottleneck Procedure for Job Shop Scheduling	4	12	41	434	6	27	111	960
When Lift-and-Project Cuts Are Different	0	1	2	4	0	4	12	25
Total Journal Articles	8	30	91	988	19	134	514	2,701

8 registered items for which data could not be found

Book	File Downloads				Abstract Views
Book	Last month	3 months	12 months	Total	Last month	3 months	12 months	Total
Der Wille zur Freiheit	0	0	0	0	0	1	2	2
Disjunctive Programming	0	0	0	0	0	1	4	4
Total Books	0	0	0	0	0	2	6	6

Chapter	File Downloads				Abstract Views
Chapter	Last month	3 months	12 months	Total	Last month	3 months	12 months	Total
Angehender Emigrant	0	0	0	0	0	1	1	1
Cuts from General Disjunctions	0	0	0	0	0	2	2	2
Das Malmezon I	0	0	0	0	0	1	6	6
Das Malmezon II	0	0	0	0	0	1	4	4
Die Folgen	0	0	0	0	0	1	4	4
Die Londoner Gesandtschaft	0	0	0	0	0	2	3	3
Disjunctive Cuts from the V -Polyhedral Representation	0	0	0	0	0	3	5	5
Disjunctive Programming	0	0	0	0	1	6	8	8
Disjunctive Programming and Extended Formulations	0	0	0	0	0	5	6	6
Disjunctive Programming and Its Relation to Integer Programming	0	0	0	0	0	4	5	5
Exodus	0	0	0	0	0	2	3	3
Flucht und Befreiung	0	0	0	0	0	2	2	2
Im Dienst der Sache	0	0	0	0	0	1	3	3
Implementation and Testing of Variants	0	0	0	0	0	1	2	2
Ketzerei und Ausstoßung	0	0	0	0	0	1	1	1
Kindheit und Jugend	0	0	0	0	0	1	3	3
Klausenburg nach dem Krieg	0	0	0	0	0	1	2	2
Lift-and-Project Cuts for Mixed 0-1 Programs	0	0	0	0	0	2	3	3
Moving Between Conjunctive and Disjunctive Normal Forms	0	0	0	0	0	2	3	3
Nonlinear Higher-Dimensional Representations	0	0	0	0	0	1	4	4
On the Cycle Polytope of a Directed Graph and Its Relaxations	0	0	0	0	1	2	5	7
Reformkommunist	0	0	0	0	0	3	4	4
Sequential Convexification of Disjunctive Sets	0	0	0	0	0	3	5	5
Solving (CGLP)k on the LP Simplex Tableau	0	0	0	0	0	1	1	1
The Convex Hull of a Disjunctive Set	0	0	0	0	0	1	4	4
The Correspondence Between Lift-and-Project Cuts and Simple Disjunctive Cuts	0	0	0	0	0	1	3	3
Unions of Polytopes in Different Spaces	0	0	0	0	0	3	4	4
Untergetaucht	0	0	0	0	0	1	1	1
Verhaftet	0	0	0	0	0	1	2	2
Vom Gipfel in den Abgrund	0	0	0	0	0	1	2	2
Von der Ökonomie zur Mathematik	0	0	0	0	0	1	3	3
Total Chapters	0	0	0	0	2	58	104	106

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Authors with no registered papers

LogEc provides access and usage statistics for services based on the RePEc data set.

LogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Since October 2025, abstract view statistics are potentially heavily influenced by traffic from AI bots and tools that we could not eliminate despite our best efforts.

Statistics updated 2026-07-10