Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
E. Balas
Information about the author E. Balas will soon be added to the site.
Found
8 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On unions and dominants of polytopes
2004
A well-known result on unions of polyhedra in the same space gives an extended...
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0–1 programming
2003
We establish a precise correspondence between lift-and-project cuts for mixed...
A dynamic subgradient-based branch-and-bound procedure for set covering
1996
We discuss a branch and bound algorithm for set covering, whose centrepiece is a new...
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
1998
In an earlier paper, we have developed a heuristic for generating large cliques in an...
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
1996
The linear programming relaxation of the minimum vertex coloring problem, called the...
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs
1991
Efficient algorithms are known for finding a maximum weight stable set, a minimum...
A parallel shortest augmenting path algorithm for the assignment problem
1991
A parallel version of the shortest augmenting path algorithm for the assignment...
Gomory cuts revisited
1996
The authors investigate the use of Gomory’s mixed integer cuts within a...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers