Searching for authors named Egon Balas – sorted by Relevance.
-
A Precise Correspondence Between Lift-and-Project Cuts, Simple Disjunctive Cuts
- -1 Programming Egon Balas 1 and Michael Perregaard 2 August 2000 Revised November 2001 1 Graduate School
- Cited by 11 (3 self) – Add To MetaCart
-
Lift-and-Project for Mixed 0-1 Programming: Recent Progress
- Lift-and-Project for Mixed 0-1 Programming: Recent Progress 1 Egon Balas and Michael Perregaard
- Cited by 7 (1 self) – Add To MetaCart
-
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems
- Simonetti and Egon Balas ? Carnegie Mellon University, Pittsburgh PA 15213, USA Abstract. This paper
- Cited by 3 (0 self) – Add To MetaCart
-
Generating Cuts from Multiple-Term Disjunctions
- Generating Cuts from Multiple-Term Disjunctions ? Michael Perregaard and Egon Balas Carnegie
- Cited by 1 (1 self) – Add To MetaCart
-
A.: Optimizing over the split closure
- Optimizing over the Split Closure Egon Balas Anureet Saxena December 2005 Abstract The polyhedron
- Cited by 3 (0 self) – Add To MetaCart
-
OCTANE: A New Heuristic for Pure 0--1 Programs
- OCTANE: A New Heuristic for Pure 0--1 Programs Egon Balas 1 , Sebasti'an Ceria 2 , Milind
- Add To MetaCart
-
On unions and dominants of polytopes
- On Unions and Dominants of Polytopes ∗ Egon Balas † , Alexander Bockmayr ‡ , Nicolai Pisaruk
- Cited by 4 (0 self) – Add To MetaCart
-
Job Shop Scheduling with Deadlines
- Job Shop Scheduling with Deadlines Egon Balas Giuseppe Lancia Paolo Serafini y Alkiviadis
- Cited by 6 (0 self) – Add To MetaCart
-
OCTANE: A New Heuristic for Pure 0-1 Programs
- OCTANE: A New Heuristic for Pure 0--1 Programs Egon Balas 1 , Sebasti'an Ceria 2 , Milind
- Cited by 7 (0 self) – Add To MetaCart

