×

Found 55 Documents (Results 1–55)

Computing the integer hull of convex polyhedral sets. (English) Zbl 1507.14083

Boulier, François (ed.) et al., Computer algebra in scientific computing. 24th international workshop, CASC 2022, Gebze, Turkey, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13366, 246-267 (2022).
PDFBibTeX XMLCite
Full Text: DOI

Symbolic execution + model counting + entropy maximization = automatic search synthesis. (English) Zbl 07455740

Raskin, Jean-Francois (ed.) et al., Proceedings of the 11th international symposium on games, automata, logics, and formal verification, GandALF 2020, Brussels, Belgium, September 21–22, 2020. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 326, 50-65 (2020).
MSC:  68Q60 68Q87
PDFBibTeX XMLCite
Full Text: arXiv Link

Handbook of discrete and computational geometry. 3rd revised and updated edition. (English) Zbl 1375.52001

Discrete Mathematics and Its Applications. Boca Raton, FL: CRC Press (ISBN 978-1-4987-1139-5/hbk; 978-1-4987-1142-5/ebook). xxi, 1927 p. (2017).
PDFBibTeX XMLCite
Full Text: Link

Topics in hyperplane arrangements, polytopes and box-splines. (English) Zbl 1217.14001

Universitext. New York, NY: Springer (ISBN 978-0-387-78962-0/pbk; 978-0-387-78963-7/ebook). xx, 384 p. (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Integer programming and algorithmic geometry of numbers. (English) Zbl 1187.90197

Jünger, Michael (ed.) et al., 50 years of integer programming 1958–2008. From the early years to the state-of-the-art. Papers based on the presentations at the special session at the 12th combinatorial optimization workshop AUSSOIS 2008, Aussois, France January 7–11, 2008. With DVD. Berlin: Springer (ISBN 978-3-540-68274-5/hbk; 978-3-540-68279-0/ebook). 505-559 (2010).
MSC:  90C10 90C25 11Hxx
PDFBibTeX XMLCite
Full Text: DOI

polymake and lattice polytopes. (English) Zbl 1391.52019

Krattenthaler, Christian (ed.) et al., Proceedings of the 21st annual international conference on formal power series and algebraic combinatorics, FPSAC 2009, Hagenberg, Austria, July 20–24, 2009. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 491-502 (2009).
MSC:  52B55 05B20
PDFBibTeX XMLCite
Full Text: arXiv Link

Using invariants for phylogenetic tree construction. (English) Zbl 1158.92033

Putinar, Mihai (ed.) et al., Emerging applications of algebraic geometry. Papers of the IMA workshops Optimization and control, January 16–20, 2007 and Applications in biology, dynamics, and statistics, March 5–9, 2007, held at IMA, Minneapolis, MN, USA. New York, NY: Springer (ISBN 978-0-387-09685-8/hbk). The IMA Volumes in Mathematics and its Applications 149, 89-108 (2009).
PDFBibTeX XMLCite
Full Text: arXiv

Local Euler-Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of a rational polytope. (English) Zbl 1162.52008

Beck, Matthias (ed.) et al., Integer points in polyhedra—geometry, number theory, algebra, optimization, statistics. Proceedings of the AMS-IMS-SIAM joint summer research conference, Snowbird, UT, USA, June 11–15, 2006. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4173-0/pbk). Contemporary Mathematics 452, 15-33 (2008).
MSC:  52B45 52B20
PDFBibTeX XMLCite
Full Text: arXiv

Exact algorithms and software in optimization and polyhedral computation. (English) Zbl 1489.68410

Jeffrey, David J. (ed.), Proceedings of the 2008 international symposium on symbolic and algebraic computation, ISSAC 2008, Linz/Hagenberg, Austria, July 20–23, 2008. New York, NY: Association for Computing Machinery (ACM). 333-334 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Counting solutions of integer programs using unrestricted subtree detection. (English) Zbl 1142.90453

Perron, Laurent (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 5th international conference, CPAIOR 2008 Paris, France, May 20–23, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68154-0/pbk). Lecture Notes in Computer Science 5015, 278-282 (2008).
MSC:  90C10 90C57
PDFBibTeX XMLCite
Full Text: DOI

Computing the continuous discretely. Integer-point enumeration in polyhedra. (English) Zbl 1114.52013

Undergraduate Texts in Mathematics. New York, NY: Springer (ISBN 978-0-387-29139-0/hbk; 978-0-387-46112-0/ebook). xviii, 226 p. (2007).
PDFBibTeX XMLCite
Full Text: DOI

The complexity of generating functions for integer points in polyhedra and beyond. (English) Zbl 1099.05003

Sanz-Solé, Marta (ed.) et al., Proceedings of the international congress of mathematicians (ICM), Madrid, Spain, August 22–30, 2006. Volume III: Invited lectures. Zürich: European Mathematical Society (EMS) (ISBN 978-3-03719-022-7/hbk). 763-787 (2006).
PDFBibTeX XMLCite

Coefficients and roots of Ehrhart polynomials. (English) Zbl 1153.52300

Barvinok, Alexander (ed.) et al., Integer points in polyhedra. Geometry, number theory, algebra, optimization. Proceedings of an AMS-IMS-SIAM joint summer research conference on integer points in polyhedra, Snowbird, UT, USA, July 13–17, 2003. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3459-2/pbk). Contemporary Mathematics 374, 15-36 (2005).
MSC:  52B20 52C07 05A15
PDFBibTeX XMLCite
Full Text: arXiv

Integer points in polyhedra. Geometry, number theory, algebra, optimization. Proceedings of an AMS-IMS-SIAM joint summer research conference on integer points in polyhedra, Snowbird, UT, USA, July 13–17, 2003. (English) Zbl 1065.00009

Contemporary Mathematics 374. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3459-2/pbk). xi, 191 p. (2005).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software