The following pages link to Egon Balas (Q344929):
Displayed 50 items.
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- (Q435729) (redirect page) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Some thoughts on the development of integer programming during my research career (Q537575) (← links)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← links)
- Traffic assignment in communication satellites (Q594769) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- A hard integer program made easy by lexicography (Q715074) (← links)
- The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- Bender's method revisited (Q1050092) (← links)
- Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- On the convex hull of the union of certain polyhedra (Q1115345) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- Strengthening cuts for mixed integer programs (Q1142702) (← links)
- Correction to ''Disjunctive programming'' (Q1172547) (← links)
- A note on duality in disjunctive programming (Q1229803) (← links)
- On the dimension of projected polyhedra (Q1270766) (← links)
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems (Q1273655) (← links)
- Disjunctive programming: Properties of the convex hull of feasible points (Q1281382) (← links)
- New classes of efficiently solvable generalized traveling salesman problems (Q1290165) (← links)
- Robert G. Jeroslow 1942-1988 (Q1363107) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- On the monotonization of polyhedra (Q1373726) (← links)
- Job shop scheduling with deadlines (Q1383797) (← links)
- Projection with a minimal system of inequalities (Q1384096) (← links)
- Recognizing facet defining inequalities (Q1384420) (← links)
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming (Q1411611) (← links)
- On unions and dominants of polytopes (Q1434071) (← links)
- Erratum to ``Intersection cuts -- standard versus restricted'' (Q1662165) (← links)
- Intersection cuts -- standard versus restricted (Q1751139) (← links)
- Logical constraints as cardinality rules: Tight representation (Q1768603) (← links)
- Linear-time separation algorithms for the three-index assignment polytope (Q1801663) (← links)
- Sequential convexification in reverse convex and disjunctive programming (Q1825137) (← links)
- Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold medal, July 9, 2001, Rotterdam (Q1848615) (← links)
- The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Facets of the three-index assignment polytope (Q2276881) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
- Pivot and shift -- a mixed integer programming heuristic (Q2386208) (← links)