scientific article; zbMATH DE number 2084778

MaRDI QIDQ4735936zbMATH OpenFDO

Authors E. Balas

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2241/22410026.htm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Recommendations

• Projection, lifting and extended formulation integer and combinatorial optimization
• On optimizing over lift-and-project closures
• scientific article; zbMATH DE number 1225250
• Projective algorithms for solving complementarity problems
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
• Lift and project relaxations for the matching and related polytopes
• Projection algorithms for composite minimization
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Lift-and-project cuts for mixed integer convex programs
• Convex combinatorial optimization

Cited in

(19)

• Lift-and-project methods for set cover and knapsack
• Projection heuristics for binary branchings between sum and product
• Lift-and-project for general two-term disjunctions
• Kőnig's edge-colouring theorem for all graphs
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• A polytope for a product of real linear functions in 0/1 variables
• scientific article; zbMATH DE number 6707767 (Why is no real title available?)
• Improved compact formulations for metric and cut polyhedra
• Solving the hub location problem in a star–star network
• A large class of facets for the \(K\)-median polytope
• Bayesian persuasion: reduced form approach
• Lifting, tilting and fractional programming revisited
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Preprocessing and valid inequalities for exact detection of critical nodes via integer programming
• Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the \(\mathrm{p}\)-median problem
• Mixing polyhedra with two non divisible coefficients
• Random allocations of multiple objects with incomplete information
• Projection, lifting and extended formulation integer and combinatorial optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735936)