Linear programs for constraint satisfaction problems

DOI10.1016/S0377-2217(96)00071-9zbMath0920.90106OpenAlexW2068322802MaRDI QIDQ1278588

Angelo Monfroglio, Hans-Juergen Zimmermann

Publication date: 27 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00071-9

zbMATH Keywords

quadratic assignmentsatisfiability problemtraveling salespersonconjunctive normal form satisfactionminimal set covering

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (3)

NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM ⋮ Hybrid heuristic algorithms for set covering. ⋮ Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A ``build-down scheme for linear programming
• The complexity of facets (and some facets of complexity)
• Decomposition of regular matroids
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Integer programs for logic constraint satisfaction
• The logic of constraint satisfaction
• The traveling salesman. Computational solutions for RSP applications
• Easy problems are sometimes hard
• Solving propositional satisfiability problems
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
• A Human Oriented Logic for Automatic Theorem-Proving
• Propositional calculus problems in CHIP
• Integral Extreme Points
• A Computing Procedure for Quantification Theory

This page was built for publication: Linear programs for constraint satisfaction problems