Computing an integer point of a class of convex sets.

DOI10.1023/A:1026438301292zbMath1041.90030MaRDI QIDQ5929418

No author found.

Publication date: 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

integer labelingsimplicial methodstriangulations

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Unnamed Item
• Unnamed Item
• The computation of fixed points and applications
• An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
• Simplizialzerlegungen von beschränkter Flachheit
• A Simplicial Approach to the Determination of an Integer Point of a Simplex
• The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• A class of simplicial restart fixed point algorithms without an extra dimension
• Production Sets with Indivisibilities, Part I: Generalities
• Production Sets with Indivisibilities, Part II: The Case of Two Activities
• A new variable dimension algorithm for the fixed point problem
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• The Approximation of Fixed Points of a Continuous Mapping
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Homotopies for computation of fixed points on unbounded regions
• Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm

This page was built for publication: Computing an integer point of a class of convex sets.