sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000117704555 | 1 hits
Person
ISNI: 
0000 0001 1770 4555
Name: 
Balas, E
Balas, Egon
Balas Egon (Amerikában élő román származású magyar zsidó matematikus, az MTA külső tagja)
Egon Balas (Mathematician)
Egon Balas (rumænsk matematiker)
Egon Balas (rumänischer Mathematiker)
Egon Balas (rumänsk matematiker)
Egon Balas (rumensk matematikar)
Egon Balas (rumensk matematiker)
Egon Balas (wiskundige uit Roemenië)
Dates: 
1922-
Creation class: 
Computer file
Language material
Text
txt
Creation role: 
author
editor
redactor
Related names: 
Balas, Edith (1929-; Beziehung familiaer; see also from)
Carnegie-Mellon University, Pittsburgh, Penns.. Graduate School of industrial administration. Management Sciences Research Group
Clausen, Jens (1950- ))
Evrat, Nathalie
Lenstra, J.K.
Lenstra, Jan Karel
Minoux, Michel
Padberg, Manfred W.
Pulleyblank, William R.
University of Waterloo. Faculty of Mathematics
Vazacopoulos, Alkis
Titles: 
Adjacent Vertices of the convex hull of feasible 0-1 points
Algorithm for the Three-Index Assignment Problem, An
asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph., The
dynamic subgradient-based branch-and-bound procedure for set covering, A
Guided local search with shifting bottleneck for job shop scheduling
Integer programming and combinatorial optimization : 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995 : proceedings
Intersection cuts from maximal convex extensions of the ball and the octahedron
liberté et rien d'autre
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
machine scheduling with delayed precedence constraints
Minimax et dualité en programmation discrète
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework
note on the Weiszfeld-Kuhn algorithm for the general fermat problem, A
Octane: A new heuristic for pure 0-1 programs
On the maximum-weight clique problem
On the set-covering problem
one-machine problem with delayed precedence constraints and its use on job shop scheduling, The
Optimizing over the split closure
Parallel Shortest Augmenting Path Algorithm for the Assignment Problem, A
perfectly matchable subgraph polytope of an arbitrary graph, The
precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming, A
Programmation mathématique : théorie et algorithmes.
Sharp bound on the ratio between optimal integer and fractional covers.
Shifting Bottleneck Procedure for Job Shop Scheduling, The
Will to freedom a perilous journey through fascism and communism
Wille zur Freiheit eine gefährliche Reise durch Faschismus und Kommunismus, Der
Notes: 
Sources: 
VIAF DNB LAC LC NUKAT SUDOC WKD
BOWKER
NTA