A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Constraint satisfaction methods for generating valid cuts
Advances in computational and stochastic optimization, logic programming, and heuristic search
The OPL optimization programming language
The OPL optimization programming language
Mixed logical-linear programming
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Constraint-Based Scheduling
Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers
Annals of Mathematics and Artificial Intelligence
Logic-Based Methods for Optimization
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Framework for Constraint Programming Based Column Generation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Tight Cooperation and Its Application in Piecewise Linear Optimization
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
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
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming
INFORMS Journal on Computing
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
Optimal Design of Truss Structures by Logic-Based Branch and Cut
Operations Research
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
INFORMS Journal on Computing
Logic, Optimization, and Constraint Programming
INFORMS Journal on Computing
A scheme for unifying optimization and constraint satisfaction methods
The Knowledge Engineering Review
Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
Mathematical Programming: Series A and B
Hybrid Column Generation Approaches for Urban Transit Crew Management Problems
Transportation Science
A Hybrid Method for the Planning and Scheduling
Constraints
Integrated Methods for Optimization (International Series in Operations Research & Management Science)
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
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
On the Facial Structure of the Alldifferent System
SIAM Journal on Discrete Mathematics
Reconsidering mixed integer programming and MIP-Based hybrids for scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The constraint of difference and total dual integrality
Proceedings of the 17th Panhellenic Conference on Informatics
Hi-index | 0.00 |
One of the central trends in the optimization community over the past several years has been the steady improvement of general-purpose solvers. A logical next step in this evolution is to combine mixed-integer linear programming, constraint programming, and global optimization in a single system. Recent research in the area of integrated problem solving suggests that the right combination of different technologies can simplify modeling and speed up computation substantially. Nevertheless, integration often requires special-purpose coding, which is time consuming and error prone. We present a general-purpose solver, SIMPL, that allows its user to replicate (and sometimes improve on) the results of custom implementations with concise models written in a high-level language. We apply SIMPL to production planning, product configuration, machine scheduling, and truss structure design problems on which customized integrated methods have shown significant computational advantage. We obtain results that either match or surpass the original codes at a fraction of the implementation effort.