The following pages link to (Q4735936):
Displaying 16 items.
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- A large class of facets for the \(K\)-median polytope (Q543406) (← links)
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- (Q2978513) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)
- Bayesian persuasion: reduced form approach (Q6114948) (← links)
