Cutting to the Chase Solving Linear Integer Arithmetic

12 years 4 months ago

Download cs.nyu.edu

Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conﬂicting states.

Dejan Jovanovic, Leonardo Mendonça de Moura

Real-time Traffic

CADE 2011 | Integer Programming Problems | Linear Integer | Logical Reasoning | Style Search |

claim paper

» Cuts from Proofs A Complete and Practical Technique for Solving Linear Inequalities over I...

» An algorithm to solve integer linear systems exactly using numerical methods

» RTLDatapath Verification using Integer Linear Programming

» Pruning by Isomorphism in BranchandCut

» Combinatorial Benders Cuts for MixedInteger Linear Programming

» Computational Experience with an Interior Point Cutting Plane Algorithm

» MUNCH Automated Reasoner for Sets and Multisets

» On the Exact Separation of Mixed Integer Knapsack Cuts

Post Info
More Details (n/a)

Added	13 Dec 2011
Updated	13 Dec 2011
Type	Journal
Year	2011
Where	CADE
Authors	Dejan Jovanovic, Leonardo Mendonça de Moura

Comments (0)

Sciweavers

Cutting to the Chase Solving Linear Integer Arithmetic

CADE 2011 | Integer Programming Problems | Linear Integer | Logical Reasoning | Style Search |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers