Beating the SDP bound for the floor layout problem: A simple combinatorial idea

@inproceedings{Huchette2016BeatingTS,
  title={Beating the SDP bound for the floor layout problem: A simple combinatorial idea},
  author={Joey Huchette and Santanu S. Dey and Juan Pablo Vielma},
  year={2016}
}
For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semidefinite programming (SDP) relaxation hierarchies. In this paper, we introduce an alternative bounding approach that exploits the "combinatorial implosion" effect by solving portions of the original problem and aggregating this information to obtain a global dual bound. We apply this technique to the… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

Tables from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Theory and computation of sparse cutting planes

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 40 REFERENCES

Global lower bounds for the VLSI macrocell floorplanning problem using semidefinite optimization

VIEW 17 EXCERPTS
HIGHLY INFLUENTIAL

Integer Programming

  • Conforti, Michele, Gérard Cornuéjols, Giacomo Zambelli.
  • Springer.
  • 2014
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

back from the other side of the tipping point

  • Castillo, Ignacio, Joakim Westerlund, Stefan Emet, Tapio Westerlund
  • Annals of Operations Research
  • 2005
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Optimization methods and available software. Part 1.

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

JuMP: A Modeling Language for Mathematical Optimization

VIEW 1 EXCERPT

Huchette et al. (2015) for details). Additionally, we omit the p ́q symmetry-breaking constraints

  • Castillo
  • 2015