Logic applied to integer programming and integer programming applied to logic
From MaRDI portal
Publication:1130078
DOI10.1016/0377-2217(93)E0359-6zbMath0906.90130OpenAlexW2160258662MaRDI QIDQ1130078
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0359-6
Related Items
Linear temporal logic vehicle routing with applications to multi-UAV mission planning ⋮ An artificial neural network satisfiability tester ⋮ A combined CLP-MILP approach for scheduling commodities in a pipeline ⋮ On infinite horizon switched LQR problems with state and control constraints ⋮ Mixed logical-linear programming ⋮ Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos ⋮ New tractable classes for default reasoning from conditional knowledge bases ⋮ Construction of rule-based assignment models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing integer programming models by the predicate calculus
- Some results and experiments in programming techniques for propositional logic
- Logic-based decision support. Mixed integer model formulation
- Fourier-Motzkin elimination extension to integer programming problems
- Tools for reformulating logical forms into zero-one mixed integer programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- A Way to Simplify Truth Functions
- Fourier's Method of Linear Programming and Its Dual
- Algorithms for testing the satisfiability of propositional formulae
- Input Proofs and Rank One Cutting Planes
- The Elimination of Integer Variables
- Solving the incremental satisfiability problem
- Facets of the knapsack polytope
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- Extended Horn sets in propositional logic
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- The Problem of Simplifying Truth Functions
