Simplicial pivoting algorithms for a tractable class of integer programs

Journal of Combinatorial Optimization

Volumn 6, Issue 2, 2002, Pages 133-142

  Van Maaren, H ^a   Dang, C ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Horn formulas; Integer programming; Simplicial algorithms

Indexed keywords

ALGORITHMS; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; PROBLEM SOLVING;

HORN FORMULAS; SIMPLICIAL PIVOTING ALGORITHMS; TRACTABLE CLASS;

INTEGER PROGRAMMING;

EID: 0036604766     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013847510365     Document Type: Article

References (20)

1. Integer programming problems for which a simple rounding type algorithm works
2. Extended horn sets in propositional logic
3. Polyhedral sets having a least element
4. A simplicial approach to the determination of an integer point of a simplex
5. An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
6. Linear-time algorithms for testing the satisfiability of propositional Horn formulae
7. Computing kakutani fixed points
8. Computing all solutions of systems of polynomial equations by simplicial fixed point algorithms
9. Relative size of certain polynomial time solvable subclasses of satisfiability
10. Varible dimension complexes. II. A unified approach to some combinatorial lemmas in topology
11. A bound escalation method for the solution of integer linear programs
12. Simple and fast algorithms for linear and integer programs with two variables per inequality
13. 1 mappings in fixed points and complementarity theory
14. Finding roots of polynomials by pivoting
15. The computational complexity of simultaneous diophantine approximation problems
16. A method of truncated relaxation for integer programming
17. A class of simplicial restart fixed point algorithms without an extra dimension