CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Programming Contribution to Benders Decomposition: A Case Study
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Relaxation of the Cumulative Constraint
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Hybrid Method for the Planning and Scheduling
Constraints
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Computers and Operations Research
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
Computers and Operations Research
A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
Computers and Operations Research
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Solving a real-time allocation problem with constraint programming
Journal of Systems and Software
A comparison of automation techniques for optimization of compressor scheduling
Advances in Engineering Software
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Cost-Based Domain Filtering for Stochastic Constraint Programming
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Computers and Operations Research
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
Allocation and scheduling for MPSoCs via decomposition and no-good generation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Engineering Applications of Artificial Intelligence
An Integrated Solver for Optimization Problems
Operations Research
Hybrid algorithms in constraint programming
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Constraint integer programming: a new approach to integrate CP and MIP
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Multi-stage benders decomposition for optimizing multicore architectures
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Minimizing the total completion time for the TFT-array factory scheduling problem (TAFSP)
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Evaluating optimization models to solve SALBP
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Large-scale public R&D portfolio selection by maximizing a biobjective impact measure
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on recent advances in biometrics
Robotics and Computer-Integrated Manufacturing
Computers and Operations Research
Checking-up on branch-and-check
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A cutting plane approach for integrated planning and scheduling
Computers and Operations Research
Rule-based modeling and constraint programming based solution of the assembly line balancing problem
Expert Systems with Applications: An International Journal
Identifying and exploiting problem structures using explanation-based constraint programming
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A hybrid algorithm for a class of resource constrained scheduling problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A search-infer-and-relax framework for integrating solution methods
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Convex programming methods for global optimization
COCOS'03 Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Duality in optimization and constraint satisfaction
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Allocation, scheduling and voltage scaling on energy aware MPSoCs
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
On the separability of subproblems in benders decompositions
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Single-Facility scheduling over long time horizons by logic-based benders decomposition
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cutting plane algorithms for solving a stochastic edge-partition problem
Discrete Optimization
INFORMS Journal on Computing
Journal of Intelligent and Robotic Systems
| Hi-index | 0.00 |
The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the two methods. The class of problems considered in this paper have the characteristic that only a subset of the binary variables have non-zero objective function coefficients if modeled as an MILP. This class of problems is formulated as a hybrid MILP/CP model that involves some of the MILP constraints, a reduced set of the CP constraints, and equivalence relations between the MILP and the CP variables. An MILP/CP based decomposition method and an LP/CP-based branch-and-bound algorithm are proposed to solve these hybrid models. Both these algorithms rely on the same relaxed MILP and feasibility CP problems. An application example is considered in which the least-cost schedule has to be derived for processing a set of orders with release and due dates using a set of dissimilar parallel machines. It is shown that this problem can be modeled as an MILP, a CP, a combined MILP-CP OPL model (Van Hentenryck 1999), and a hybrid MILP/CP model. The computational performance of these models for several sets shows that the hybrid MILP/CP model can achieve two to three orders of magnitude reduction in CPU time.