See this document in CiteSeerX!

Reduced Cost-Based Ranking for Generating Promising Subproblems (2002)  (Make Corrections)  (10 citations)
M. Milano, W. J. van Hoeve
Eighth International Conference on the Principles and Practice of Constraint Programming (CP'02)



  Home/Search   Context   Related

 
View or download:
homepages.cwi.nl/~wjvh/pap...ercim02.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  homepages.cwi.nl/~wjvh/publ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we propose an effective search procedure that interleaves two steps: subproblem generation and subproblem solution. We mainly focus on the first part. It consists... (Update)

Cited by:   More
Postponing Branching Decisions - Willem Jan Van   (Correct)
Exploiting Semidefinite Relaxations in Constraint Programming - van Hoeve (2003)   (Correct)
A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve (2003)   (Correct)

Similar documents (at the sentence level):
35.0%:   Reduced Cost-Based Ranking for Generating Promising Subproblems - Milano, van Hoeve (2002)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Fast Lower Bounds for the Capacitated Minimum Spanning.. - Frangioni, Pretolani.. (1999)   (Correct)
0.3:   Global Constraints: When Constraint Programming.. - Milano, Ottosson, .. (2001)   (Correct)
0.2:   On the Reformulation of Vehicle Routing Problems and.. - Beck, Prosser, Selensky (2002)   (Correct)

Similar documents based on text:   More   All
0.4:   The Mobile Agent Technology to Support and to Access Museum .. - Bellavista, Corradi (2000)   (Correct)
0.3:   The alldifferent Constraint: A Survey - van Hoeve (2001)   (Correct)
0.3:   Diffusive Algorithms for Dynamic Load Balancing in.. - Corradi, Leonardi.. (1996)   (Correct)

Related documents from co-citation:   More   All
15:   Reference Manual (context) - SOLVER - 1995
10:   Limited discrepancy search - Harvey, Ginsberg - 1995
5:   The maximum clique problem (context) - Pardalos, Xu - 1994

BibTeX entry:   (Update)

M. Milano and W.J. van Hoeve. Reduced cost-based ranking for generating promising subproblems. In P. van Hentenryck, editor, Eighth International Conference on the Principles and Practice of Constraint Programming (CP'02), volume 2470 of LNCS, pages 1--16. Springer Verlag, 2002. http://citeseer.ist.psu.edu/milano02reduced.html   More

@inproceedings{ milano02reduced,
  author = "M. Milano and W. van Hoeve",
  title = "Reduced cost-based ranking for generating promising subproblems",
  editor = "P. van Hentenryck",
  booktitle = "Eighth International Conference on the Principles and Practice of 
    Constraint Programming (CP'02)",
  volume = "2470",
  series = "LNCS",
  pages = "1--16",
  publisher = "Springer Verlag",
  year = "2002",
  url = "citeseer.ist.psu.edu/milano02reduced.html" }
Citations (may not include all citations):
134   Limited Discrepancy Search - Harvey, Ginsberg - 1995
125   Greedy randomized adaptive search procedures - Feo, Resende - 1995
92   Reference Manual (context) - Solver - 2000
92   Reference Manual (context) - Scheduler - 2000
91   Artificial Intelligence (context) - Ginsberg, Harvey - 1992
54   Systematic and nonsystematic search strategies (context) - Langley - 1992
17   Cost-based domain filtering (context) - Focacci, Lodi et al. - 1999
13   TSPLIB - a Travelling Salesman Problem Library (context) - Reinelt - 1991
10   An additive bounding procedure for the asymmetric travelling.. (context) - Fischetti, Toth - 1992
10   Solving tsp with time windows with constraints (context) - Focacci, Lodi et al. - 1999
8   Solving TSP through the integration of OR and CP techniques (context) - Focacci, Lodi et al. - 1998
8   Algorithms and codes for the Assignment Problem (context) - Carpaneto, Martello et al. - 1988
5   cient algorithm for the minimum capacity cut problem (context) - Padberg, Rinaldi - 1990
4   Solving scheduling problems with setup times and alternative.. (context) - Focacci, Laborie et al. - 2000
2   An additive bounding procedure for combinatorial optimizatio.. (context) - Fischetti, Toth - 1989
1   Vigo Eds (context) - Focacci, Lodi et al. - 1999
1   Special issue on The merging of Mathematical Programming and.. (context) - Focacci, Lodi et al.
1   Cp-based lagrangean relaxation for a multi-media application (context) - Fahle, Sellman - 2001
1   Linear assignment (context) - Dell'Amico, Martello - 1997
1   Personal communication (context) - Lodi
1   Wallace Eds (context) - Gervet - 2001
1   Tschoeke Eds (context) - Junker, Karisch - 2000
1   Jussien Eds (context) - Laburthe - 2002
http://www.zib.de/ascheuer/ATSPTWinstances.html



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://homepages.cwi.nl/~wjvh/publ.html):   More
Parallel Branch-and-Bound Algorithms using Semidefinite.. - van Hoeve (1999)   (Correct)
Decomposition Based Search - a Theoretical And Experimental.. - van Hoeve, Milano (2003)   (Correct)
The alldifferent Constraint: A Survey - van Hoeve (2001)   (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