Packing of concave polyhedra with continuous rotations using nonlinear optimisation

DOI10.1016/j.ejor.2018.01.025zbMath1403.90586WikidataQ61307746 ScholiaQ61307746MaRDI QIDQ1754302

Xianqiang Yang

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/139289/1/EJOR-concave%20polytopes%20final.pdf

zbMATH Keywords

packing; mathematical modelling; nonlinear optimisation; concave polyhedra; continuous rotations

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

52B55: Computational aspects related to convexity

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

Uses Software

• Ipopt