Exact algorithms and software in optimization and polyhedral computation

DOI10.1145/1390768.1390814MaRDI QIDQ5301640zbMATH OpenOpenAlexFDO

Authors Komei Fukuda

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

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Exact arithmetic at low cost. -- A case study in linear programming
• Computing convex hulls and counting integer points with \texttt{polymake}
• Exact solutions to linear programming problems
• scientific article; zbMATH DE number 1303552
• polymake: a framework for analyzing convex polytopes

Cited in

(8)

• From Diophantine approximations to Diophantine equations
• Computation of the fundamental units of number rings using a generalized continued fraction
• Algorithms for solving an algebraic equation
• Normal form of a Hamiltonian system with a periodic perturbation
• An effective solution to convex 1-body \(N\)-representability
• Computation of the best Diophantine approximations and of fundamental units of algebraic fields
• On the parametrization of an algebraic curve
• Universal generalization of the continued fraction algorithm

Describes a project that uses

Uses Software

• Minksum
• barvinok
• TOPCOM
• lrs
• Gfan
• LattE
• 4ti2
• polymake
• PARI/GP
• CGAL
• cdd

This page was built for publication: Exact algorithms and software in optimization and polyhedral computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301640)