Cutting Planes in Constraint Programming: An Hybrid Approach

This publication has 16 references indexed in Scilit:

• Cost-Based Domain Filtering
  Published by Springer Nature ,1999
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
  INFORMS Journal on Computing, 1998
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
  Transportation Science, 1998
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
  Management Science, 1997
• An efficient algorithm for the minimum capacity cut problem
  Mathematical Programming, 1990
• Generalized resolution and cutting planes
  Annals of Operations Research, 1988
• Algorithms and codes for the assignment problem
  Annals of Operations Research, 1988
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
  Operations Research, 1987
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
  Operations Research Letters, 1987
• Outline of an algorithm for integer solutions to linear programs
  Bulletin of the American Mathematical Society, 1958