Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computing the integer points of a polyhedron. I: Algorithm

From MaRDI portal
Publication:1701488
Jump to:navigation, search

DOI10.1007/978-3-319-66320-3_17zbMath1455.52011OpenAlexW2751262009MaRDI QIDQ1701488

Rui-Juan Jing, Marc Moreno Maza

Publication date: 23 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66320-3_17



Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55)


Related Items (1)

Computing the integer hull of convex polyhedral sets


Uses Software

  • MetaFork



This page was built for publication: Computing the integer points of a polyhedron. I: Algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1701488&oldid=14020932"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki