Vasco Manquinho and Joao Marques-Silva  Home/Search
Context
Related
| sat.inesc.pt/~jpms/res...cpaior01.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sat.inesc.pt/~jpms...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper addresses the problem of integrating di erent lower bounding techniques into Satis ability-based algorithms for the Binate Covering Problem (BCP), a wellknown restriction of Boolean Optimization. The most signi cant aspect of integrating lower bounding techniques into Satis ability-based algorithms for BCP is the ability to backtrack non-chronologically whenever lower bounding is applied. The lower bounding techniques considered include the well-known linear programming... (Update)
Similar documents (at the sentence level): More
21.2%: Search Pruning Conditions for Boolean Optimization - Manquinho, Marques-Silva (2000) (Correct)
21.2%: Conditions for Non-Chronological Backtracking in Boolean.. - Manquinho, Marques-Silva (2000) (Correct)
12.1%: On Solving Boolean Optimization with Satisfiability-Based .. - Manquinho, Marques-Silva (2000) (Correct)
Active bibliography (related documents): More All
0.4: Models and Algorithms for Optimization Problems in Digital.. - Flores (2001) (Correct)
0.1: Efficient Data Structures for Fast SAT Solvers - Lynce, Marques-Silva (2001) (Correct)
0.1: Satisfiability-Based Algorithms for 0-1 Integer.. - Manquinho.. (Correct)
Similar documents based on text: More All
0.4: The Interplay of Randomization and Learning on Real-World .. - Baptista, Marques-Silva (2000) (Correct)
0.4: Complete Search Restart Strategies for Satisfiability - Baptista, Lynce, Marques-Silva (2001) (Correct)
0.3: Algorithms for Satisfiability in Combinational Circuits.. - Marques-Silva, Silva (1999) (Correct)
BibTeX entry: (Update)
@misc{ manquinho-lower,
author = "Vasco Manquinho and Joao Marques-Silva",
title = "Lower Bounding Techniques for SAT-based Boolean Optimization",
url = "citeseer.ist.psu.edu/445074.html" }
Citations (may not include all citations):518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
109 Logic Synthesis and Optimization Benchmarks User Guide - Yang - 1991
75 Linear Programming and Network Flows (context) - Bazaraa, Sherali - 1989
67 A Computing Procedure for Quantication Theory (context) - Davis, Putnam - 1960
54 SATO: An ecient propositional prover (context) - Zhang - 1997
32 DIMACS Series in Discrete Mathematics and Theoretical Comput.. (context) - Johnson, Trick et al. - 1994
23 On Solving Covering Problems - Coudert - 1996
17 Solving Covering Problems Using LPR-Based Lower Bounds - Liao, Devadas - 1997
13 Explicit and Implicit Algorithms for Binate Covering Problem.. (context) - Villa, Kam et al. - 1997
9 Computing Prime Implicants by Integer Programming (context) - Pizzuti - 1996
9 GRASP: A new search algorithm for satisability (context) - Silva, Sakallah - 1996
7 A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boole.. (context) - Barth - 1995
6 Two-Level Logic Minimization (context) - Coudert - 1993
4 UNIX Manual Page of lp-solve (context) - Berkelaar - 1992
1 Prime implicant computation using satisability algorithms (context) - Manquinho, Flores et al. - 1997
1 Conditions for non-chronological backtracking in boolean opt.. - Manquinho, Marques-Silva - 2000
Documents on the same site (http://sat.inesc.pt/~jpms/research/publications.html): More
Algebraic Simplification Techniques for Propositional.. - Marques-Silva (2000) (Correct)
A Model and Algorithm for Computing Minimum-Size Test.. - Flores, Neto.. (1998) (Correct)
Test Pattern Generation For Width Compression In BIST - Flores, Neto.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC