Alexander Bockmayr  Home/Search
Context Related
| mpisb.mpg.de/pub/...MPII94207.ps.Z 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: mpisb.mpg.de/activities/c...publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the finite domain techniques used in existing... (Update)
Context of citations to this paper: More
.... from mathematical programming and is based on the idea of generating strong valid inequalities within a branch and cut framework [7, 8]. Often a given practical problem can be modeled in different ways. We may use either a ffl finite domain model, where every variable...
...constraints system on finite domains, but it is to simplify as much as possible this system into an easier and more legible one. 3 In [2], Bockmayr has suggested a method to solve the linear constraint system of Pseudo Boolean constraints, using approximations for the convexe...
Cited by: More
Finite Domain and Cutting Plane Techniques in CLP(PB) - Barth, Bockmayr (1994) (Correct)
ESPRIT Basic Research project Acclaim - Final Report - Sjöland, editor (1996) (Correct)
Simplifiaction of Finite Domain Constraints - Goumairi, Tessier (1998) (Correct)
Active bibliography (related documents): More All
1.0: Linear 0-1 Inequalities and Extended Clauses - Barth (1994) (Correct)
0.9: Practical Problem Solving with Cutting Plane Algorithms.. - Jünger, Reinelt, Thienel (1994) (Correct)
0.4: Simplifying Clausal Satisfiability Problems - Peter Barth Max-Planck-Institut (1994) (Correct)
Similar documents based on text: More All
0.2: On the Chvátal Rank of Polytopes in the 0/1 Cube - Bockmayr, Eisenbrand (1997) (Correct)
0.2: A Unifying Framework for Integer and Finite Domain.. - Bockmayr, Kasper (1997) (Correct)
0.2: Detecting Infeasibility and Generating Cuts for MIP using CP - Bockmayr, Pisaruk (2003) (Correct)
Related documents from co-citation: More All
2: Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
2: Finite domain and cutting plane techniques in CLP (context) - Barth, Bockmayr - 1995
2: Logic programming with pseudo-Boolean constraints (context) - Bockmayr - 1993
BibTeX entry: (Update)
A. Bockmayr. Cutting planes in constraint logic programming. Technical Report MPII -94-207, Max-Planck-Institut fur Informatik, Saarbrucken, February 1994. http://citeseer.ist.psu.edu/bockmayr94cutting.html More
@techreport{ bockmayr94cutting,
author = "A. Bockmayr",
title = "Cutting planes in constraint logic programming",
number = "MPI-I-94-207",
address = "Saarbruecken",
year = "1994",
url = "citeseer.ist.psu.edu/bockmayr94cutting.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986 ACM
561 Constraint logic programming (context) - Jaffar, Lassez - 1987 ACM DBLP
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988 ACM
373 Constraint logic programming: A survey - Jaffar, Maher - 1994 DBLP
261 Introduction to PROLOG III (context) - Colmerauer - 1987
186 Constraint satisfaction (context) - Mackworth - 1992 ACM
117 A lift-and-project cutting plane algorithm for mixed 0-1 pro.. (context) - Balas, Ceria et al. - 1993 ACM
105 A branch-and-cut algorithm for the resolution of largescale .. (context) - Padberg, Rinaldi - 1991
101 Threshold Logic and Its Applications (context) - Muroga - 1971
44 Outline of an algorithm for integer solutions to linear prog.. (context) - Gomory - 1958
33 Boolean Methods in Operations Research and Related Areas (context) - Hammer, Rudeanu - 1968
30 Constraint logic programming language CAL (context) - Aiba, Sakai et al. - 1988
21 Boolean unification - the story so far (context) - Martin, Nipkow - 1989
20 On linear characterizations of combinatorial optimization pr.. (context) - Karp, Papadimitriou - 1982 DBLP
18 MIPLIB: A test set for mixed integer programming problems (context) - Bixby, Boyd et al. - 1992
17 Polynomial-time algorithms for regular set-covering and thre.. (context) - Peled, Simeone - 1985
16 The constraint logic programming language CHIP (context) - Dincbas, van Hentenryck et al. - 1988
16 Logic programming with pseudo-Boolean constraints (context) - Bockmayr - 1993 ACM DBLP
15 Provably good solutions for the traveling salesman problem (context) - Junger, Reinelt et al. - 1992
15 Improving LP-representations of zero-one linear programs for.. (context) - Hoffman, Padberg - 1991
15 the semantics of optimization predicates in CLP languages - Fages - 1993
13 LP-based combinatorial problem solving (context) - Hoffman, Padberg - 1985
11 lp: Linear programming and logic programming - McAloon, Tretkoff - 1993
10 Annals of Mathematics and Artificial Intelligence (context) - Hooker, for et al. - 1992 ACM
8 On defining sets of vertices of the hypercube by linear ineq.. (context) - Jeroslow - 1975
7 Verification of digital circuits using CHIP (context) - Simonis, Nguyen et al. - 1988
5 Solving mixed 0-1 programs by a lift-and-project method (context) - Balas, Ceria et al. - 1993 DBLP
4 Lift-and-project methods for mixed 0-1 programs (context) - Ceria - 1993
3 Linear 0-1 inequalities and extended clauses - Barth - 1993 ACM DBLP
3 Solving large-scale 0-1 linear programming problems (context) - Crowder, Johnson et al. - 1983
3 Facial disjunctive programs and sequences of cutting planes (context) - Blair - 1980
2 Solving 0-1 problems in CLP (context) - Barth, Bockmayr - 1993
2 Solving integer programs with Fenchel cutting planes and pre.. (context) - Boyd - 1993 DBLP
1 A complete symbolic 0-1 constraint solver (context) - Barth - 1993
1 Representation of boolean functions with a predetermined num.. (context) - Lipkin - 1987 ACM
1 Computational Optimization Center (context) - Savelsbergh, Nemhauser et al. - 1993
1 A slightly improved upper bound on the size of weights suffi.. (context) - Schmitt - 1992
1 Embedding Boolean expressions in logic programming (context) - Buttner, Simonis - 1987
1 Coefficient reduction for inequalities in 0-1 variables (context) - Bradley, Hammer et al. - 1974
1 A cutting-plane game for facial disjunctive programs (context) - Jeroslow - 1980
Documents on the same site (http://www.mpi-sb.mpg.de/activities/ccl/publ.html): More
Associative-Commutative Superposition - Bachmair, Ganzinger (1993) (Correct)
The Integration of Functions into Logic Programming: A Survey - Hanus (1994) (Correct)
On Extra Variables in (Equational) Logic Programming - Hanus (1994) (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