Integer programs for logic constraint satisfaction
From MaRDI portal
Publication:1193860
DOI10.1016/0304-3975(92)90389-WzbMath0764.90063OpenAlexW2056640952MaRDI QIDQ1193860
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90389-w
Related Items (2)
Using artificial neural networks for constraint satisfaction problem ⋮ Linear programs for constraint satisfaction problems
Cites Work
- A new polynomial-time algorithm for linear programming
- The complexity of facets (and some facets of complexity)
- Cutting planes in combinatorics
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Decomposition of regular matroids
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Connectionist networks for constraint satisfaction
- Networks of constraints: Fundamental properties and applications to picture processing
- An Analysis of Backtracking with Search Rearrangement
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- An Average Time Analysis of Backtracking
- A Sufficient Condition for Backtrack-Free Search
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- Optimizing decision trees through heuristically guided search
- The time complexity of maximum matching by simulated annealing
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Maximum matching and a polyhedron with 0,1-vertices
- Integral Extreme Points
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Integer programs for logic constraint satisfaction
