A formalization of convex polyhedra based on the simplex method (Q5915783): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6821842
scientific article; zbMATH DE number 7096718
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1468.68316 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/s10817-018-9477-1 / rank
 
Normal rank
Property / published in
 
Property / published in: Journal of Automated Reasoning / rank
 
Normal rank
Property / publication date
 
21 August 2019
Timestamp+2019-08-21T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 21 August 2019 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7096718 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: z3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Vass / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886753998 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1706.10269 / rank
 
Normal rank
Property / zbMATH Keywords
 
convex polyhedra
Property / zbMATH Keywords: convex polyhedra / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming
Property / zbMATH Keywords: linear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
simplex method
Property / zbMATH Keywords: simplex method / rank
 
Normal rank
Property / zbMATH Keywords
 
formalization of mathematics
Property / zbMATH Keywords: formalization of mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Reflexive Arithmetic Tactics the Linear Case and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: More bounds on the diameters of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements for Free! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-Free, Set-Free Concrete Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytope Lyapunov functions for stable and for stabilizable LSS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The HOL Light theory of Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the Hirsch conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems for the next century / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization of Incremental Simplex Algorithm by Stepwise Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast LCF-Style Proof Reconstruction for Z3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programs and Convex Hulls Over Fields of Puiseux Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The width of five-dimensional prismatoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 06:34, 20 July 2024

scientific article; zbMATH DE number 7096718
Language Label Description Also known as
English
A formalization of convex polyhedra based on the simplex method
scientific article; zbMATH DE number 7096718

    Statements

    A formalization of convex polyhedra based on the simplex method (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2018
    0 references
    21 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex polyhedra
    0 references
    linear programming
    0 references
    simplex method
    0 references
    formalization of mathematics
    0 references