Integer programs for logic constraint satisfaction (Q1193860): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Average Time Analysis of Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a cutting-stock problem with the constraint logic programming language CHIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5666587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing decision trees through heuristically guided search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectionist networks for constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Backtracking with Search Rearrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time complexity of maximum matching by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90389-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056640952 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:12, 30 July 2024

scientific article
Language Label Description Also known as
English
Integer programs for logic constraint satisfaction
scientific article

    Statements

    Integer programs for logic constraint satisfaction (English)
    0 references
    0 references
    27 September 1992
    0 references
    logic constraint satisfaction problems
    0 references
    NP-hard
    0 references
    deterministic polynomial time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers