☆ 4.7 Article

The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Related references

Note: Only part of the references are listed.

Article Mechanics

Mono-unstable polyhedra with point masses have at least 8 vertices

Sandor Bozoki et al.

Summary: The study focuses on the monostatic property of convex polyhedra, establishing upper and lower bounds for the minimum number of faces and vertices, and improving the lower limit on mono-unstable vertices through an algorithm.

INTERNATIONAL JOURNAL OF SOLIDS AND STRUCTURES (2022)

Add to Collection

Article Management

Iterated dynamic thresholding search for packing equal circles into a circular container

Xiangjing Lai et al.

Summary: In this study, a highly effective iterated dynamic thresholding search algorithm is proposed for packing equal circles in a circle. Computational experiments show that the algorithm outperforms the state-of-the-art algorithms in solving this difficult problem.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Add to Collection

Article Operations Research & Management Science

Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations

V Jeyakumar et al.

Summary: Adjustable robust optimization tackles data uncertainty issues, proposing an exact second-order cone program reformulation for robust linear optimization problems with inexact data and quadratically adjustable variables. A generalization of the S-lemma is utilized to reformulate separable quadratic constraints for specific conditions.

EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2021)

Add to Collection

Article Mathematics, Applied

EXACT SEMIDEFINITE PROGRAMMING BOUNDS FOR PACKING PROBLEMS

Maria Dostert et al.

Summary: This paper presents an algorithm to round the floating point output of a semidefinite programming solver to a solution over the rationals or a quadratic extension of the rationals, without strict feasibility requirement and applicable for large problems. By applying this algorithm, sharp bounds for packing problems are obtained, and it is shown that certain optimal packing configurations are unique up to rotations.

SIAM JOURNAL ON OPTIMIZATION (2021)

Add to Collection

Article Management

The exact solutions of several types of container loading problems

Deidson Vitorio Kurpel et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2020)

Add to Collection

Article Mathematics, Applied

Balancing polyhedra

Gabor Domokos et al.

ARS MATHEMATICA CONTEMPORANEA (2020)

Add to Collection

Article Mathematics

MOMENT METHODS IN ENERGY MINIMIZATION: NEW BOUNDS FOR RIESZ MINIMAL ENERGY PROBLEMS

David De Laat

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY (2020)

Add to Collection

Article Management

A multilevel analysis of the Lasserre hierarchy

Juan S. Campos et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

Add to Collection

Article Operations Research & Management Science

The Complexity of Simple Models-A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem

Immanuel M. Bomze et al.

MATHEMATICS OF OPERATIONS RESEARCH (2018)

Add to Collection

Article Computer Science, Software Engineering

Certified Roundoff Error Bounds Using Semidefinite Programming

Victor Magron et al.

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE (2017)

Add to Collection

Article Engineering, Electrical & Electronic

Optimal Power Flow as a Polynomial Optimization Problem

Bissan Ghaddar et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2016)

Add to Collection

Article Engineering, Electrical & Electronic

Application of the Moment-SOS Approach to Global Optimization of the OPF Problem

Cedric Josz et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2015)

Add to Collection

Article Mathematics, Applied

NEW LOWER BOUNDS AND ASYMPTOTICS FOR THE CP-RANK

Immanuel M. Bomze et al.

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS (2015)

Add to Collection

Article Statistics & Probability

Optimal Designs for Rational Function Regression

David Papp

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION (2012)

Add to Collection

Article Management

A heuristic for the circle packing problem with a variety of containers

C. O. Lopez et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)

Add to Collection

Review Management

Exploiting special structure in semidefinite programming: A survey of theory and applications

Etienne de Klerk

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)

Add to Collection

Article Mathematics

Experimental Study of Energy-Minimizing Point Configurations on Spheres

Brandon Ballinger et al.

EXPERIMENTAL MATHEMATICS (2009)

Add to Collection

Article Biochemical Research Methods

A New Computational Tool for Establishing Model Parameter Identifiability

Elias August et al.

JOURNAL OF COMPUTATIONAL BIOLOGY (2009)

Add to Collection

Article Mathematics

New upper bounds for kissing numbers from semidefinite programming

Christine Bachoc et al.

JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY (2008)

Add to Collection

Review Mathematics, Applied

A survey of the S-lemma

Imre Polik et al.

SIAM REVIEW (2007)

Add to Collection

Article Mathematics

My lunch with Arnold

Gabor Domokos

MATHEMATICAL INTELLIGENCER (2006)

Add to Collection

Article Mathematics, Applied

Static equilibria of rigid bodies:: Dice, pebbles, and the Poincare-Hopf theorem

P. L. Varkonyi et al.

JOURNAL OF NONLINEAR SCIENCE (2006)

Add to Collection

Article Mathematics, Applied

Improved bounds for the crossing numbers of K-m,K-n and K-n(*)

E De Klerk et al.

SIAM JOURNAL ON DISCRETE MATHEMATICS (2006)

Add to Collection

Article Mathematics

A proof of the Kepler conjecture

TC Hales

ANNALS OF MATHEMATICS (2005)

Add to Collection

Article Mathematics, Applied

Global optimization with polynomials and the problem of moments

JB Lasserre

SIAM JOURNAL ON OPTIMIZATION (2001)

Add to Collection

© Peeref 2019-2024. All rights reserved.