A Simplicial Approach to the Determination of an Integer Point of a Simplex

DOI10.1287/moor.23.2.403zbMath0977.90027OpenAlexW2013194449MaRDI QIDQ2757541

Hans van Maaren, Chuangyin Dang

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.2.403

zbMATH Keywords

triangulationinteger programminginteger labelingsimplexinteger pointvariable dimension algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (5)

A fixed point iterative approach to integer programming and its distributed computation ⋮ On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering ⋮ Computing an integer point of a class of convex sets. ⋮ Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm ⋮ Piecewise linear methods for nonlinear equations and optimization

This page was built for publication: A Simplicial Approach to the Determination of an Integer Point of a Simplex