Exact algorithms and software in optimization and polyhedral computation
From MaRDI portal
Publication:5301640
DOI10.1145/1390768.1390814zbMath1489.68410OpenAlexW2061722309MaRDI QIDQ5301640
Publication date: 20 January 2009
Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1390768.1390814
Symbolic computation and algebraic computation (68W30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Numerical optimization and variational techniques (65K10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (8)
Computation of the best Diophantine approximations and of fundamental units of algebraic fields ⋮ Unnamed Item ⋮ An effective solution to convex 1-body \(N\)-representability ⋮ Normal form of a Hamiltonian system with a periodic perturbation ⋮ Algorithms for solving an algebraic equation ⋮ Computation of the fundamental units of number rings using a generalized continued fraction ⋮ On the parametrization of an algebraic curve ⋮ Calculation of fundamental units of number rings by means of the generalized continued fraction
Uses Software
This page was built for publication: Exact algorithms and software in optimization and polyhedral computation
