W.J. van Hoeve  Home/Search
Context
Related
| cornell.edu/~vanhoeve/pa...c_and_or.pdf Cached: 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.
PS.gz PS Image Update HelpFrom: cornell.edu/~vanhoeve/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of semidefinite relaxations within constraint programming. In principle, we use the solution of a semidefinite relaxation to guide the traversal of the search tree, using a limited discrepancy search strategy. Furthermore, a semidefinite relaxation generally produces a tight bound for the solution value, which improves... (Update)
Similar documents (at the sentence level):
23.4%: Exploiting Semidefinite Relaxations in Constraint Programming - van Hoeve (Correct)
20.5%: A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve (2003) (Correct)
6.1%: Operations Research Techniques In Constraint Programming - van Hoeve (2005) (Correct)
Active bibliography (related documents): More All
0.2: The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player.. - Haanpää, Kaski (2004) (Correct)
0.2: Classification of Resolvable 2-(14,7,12) and.. - Kaski, Morales.. (Correct)
0.1: Local Probing Applied to Scheduling - Kamarainen, Sakkout (2002) (Correct)
Similar documents based on text:
3.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ hoeve-exploiting,
author = "W.J. van Hoeve",
title = "Exploiting Semidefinite Relaxations in Constraint Programming",
url = "citeseer.ist.psu.edu/vanhoeve03exploiting.html" }
Citations (may not include all citations):532 LAPACK Users' Guide (context) - Anderson, Bai et al. - 1999
482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
415 Improved Approximation Algorithms for Maximum Cut and Satisf.. - Goemans, Williamson - 1995
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lovasz et al. - 1988
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
134 Limited Discrepancy Search - Harvey, Ginsberg - 1995
93 IEEE Transactions on Information Theory (context) - Lovasz, Shannon et al. - 1979
92 Reference Manual (context) - Solver - 2001
62 The Maximum Clique Problem (context) - Pardalos, Xue - 1994
56 Automated empirical optimizations of software and the ATLAS .. - Whaley, Petitet et al. - 2001
39 The Maximum Clique Problem - Bomze, Budinich et al. - 1999
36 Library for Semidefinite Programming (context) - Borchers - 1999
24 Probe Backtrack Search for Minimal Perturbation in Dynamic S.. - Sakkout, Wallace - 2000
22 Connections between semidefinite relaxations of the max-cut .. - Laurent, Poljak et al. - 1997
18 Solving graph bisection problems with semidefinite programmi.. - Karisch, Rendl et al. - 2000
13 Combinatorial Optimization (context) - Goemans, Rendl - 2000
11 Principles of Constraint Programming - Apt - 2003
10 Reduced cost-based ranking for generating promising subprobl.. - Milano, van Hoeve - 2002
7 Computational experience with stable set relaxations (context) - Gruber, Rendl - 2003
7 LP probing for piecewise linear optimization in scheduling - Ajili, Sakkout - 2001
4 Simple and Fast: Improving a Branch-And-Bound Algorithm for .. - Fahle - 2002
4 A fast algorithm for the maximum clique problem (context) - Ostergard - 2002
4 A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve - 2003
4 Solving the Maximum Clique Problem with Constraint Programmi.. (context) - Regin - 2003
http://www.research.att.com/~njas/doc/graphs.html
Documents on the same site (http://www.cs.cornell.edu/~vanhoeve/index.html): More
A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve (2003) (Correct)
A Hyper-Arc Consistency Algorithm for the Soft Alldifferent.. - van Hoeve (Correct)
Operations Research Techniques In Constraint Programming - van Hoeve (2005) (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