scientific article; zbMATH DE number 956840
From MaRDI portal
Publication:5687247
zbMath0864.90115MaRDI QIDQ5687247
Egon Balas, Sebastián Ceria, Cornuéjols, Gérard, Gábor Pataki
Publication date: 11 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, A modified lift-and-project procedure, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, The stable set problem: clique and nodal inequalities revisited, Strong lift-and-project cutting planes for the stable set problem, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, Combining semidefinite and polyhedral relaxations for integer programs, A New Approach to the Stable Set Problem Based on Ellipsoids, On the Lovász theta function and some variants, Lift-and-project for mixed 0-1 programming: recent progress, A set packing model for the ground holding problem in congested networks, Elementary closures for integer programs., A branch-and-cut algorithm for graph coloring, A branch-and-cut algorithm for the maximum cardinality stable set problem, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, Strengthening Chvátal-Gomory Cuts for the Stable Set Problem, Projection, lifting and extended formulation integer and combinatorial optimization
