An Integrated Solver for Optimization Problems

@article{Yunes2010AnIS,
  title={An Integrated Solver for Optimization Problems},
  author={Tallys H. Yunes and Ionut D. Aron and J. Hooker},
  journal={Oper. Res.},
  year={2010},
  volume={58},
  pages={342-356}
}
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… 

Hybrid Modeling

TLDR
This chapter focuses on CP and mixed integer/linear programming (MILP), in which modeling systems are most highly developed, and suggests how an integrated modeling framework can be designed that retains, and even enhances, the modeling power of CP while allowing the full computational resources of both fields to be applied and combined.

Constraint programming and operations research

TLDR
An overview of the integration of constraint programming (CP) and operations research (OR) to solve combinatorial optimization problems is presented using four main strategies.

Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling

TLDR
It is concluded that both MIP and CIP are technologies that should be considered along with CP for solving scheduling problems and two tightly coupled hybrid models based on constraint integer programming are formulated.

Dantzig-Wolfe decomposition and branch-and-price solving in G12

TLDR
This paper explains the mapping to branch-and-price solving and demonstrates the benefits of the G12 framework on three examples: a trucking problem, cutting stock, and two-dimensional bin packing.

Logic-based Benders decomposition for planning and scheduling: a computational analysis

TLDR
A computational analysis of specific factors that contribute to the success of Logic-based Benders decomposition concludes that LBBD is most effective when the planning and scheduling aspects of the problem are roughly balanced in difficulty.

Presolving techniques and linear relaxations for cumulative scheduling

TLDR
This dissertation focuses on scheduling problems which contain a cumulative resource structure which can be shared between jobs which have to be scheduled non-preemptively and uses two problem classes which are resource-constrained project scheduling problems and resource allocation and scheduling problem.

Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-15)

TLDR
The design choices and features of RANTANPLAN are described and it is demonstrated that with SMT one can elegantly handle numeric reasoning inside any PDDL domain, thanks to the integration of various background theories with a SAT solver.

Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling

TLDR
These experiments show that both CIP and MIP approaches are competitive with LBBD in terms of the number of problems solved to proven optimality, though MIP is about three times slower on average.

Using dual presolving reductions to reformulate cumulative constraints

TLDR
This paper formally defines and justifies the use of dual information for cumulative constraints during a presolving phase of a solver, and demonstrates that a substantial proportion of them can be solved to optimality in presolving – without search.

Analyzing the computational impact of MIQCP solver components

TLDR
A computational study of the performance of a state-of-the-art solver for nonconvex mixed-integer quadratically constrained programs (MIQCPs) and focuses especially on the impact of the individual solver components.
...

References

SHOWING 1-10 OF 117 REFERENCES

SIMPL: A System for Integrating Optimization Techniques

TLDR
This work introduces a system for integrated modeling and solution called SIMPL, which consists of an infer-relax-restrict cycle in which CP and OR techniques may interact at any stage, and describes the main features of SIMPL.

HYBRID PROBLEM SOLVING IN ECLiPSe

TLDR
This chapter shows how the hybrid search can be elegantly programmed in ECLiPSe through an implementation of a generic hybrid algorithm applied on a general resource-constrained scheduling problem with a widely applicable objective function.

SCIP - a framework to integrate Constraint and Mixed Integer Programming

TLDR
This work proposes a programming framework {\sffamily SCIP} that integrates techniques from both fields in order to exploit the strenghts of both, Constraint Programming and Mixed Integer Programming.

Integrated methods for optimization

  • J. Hooker
  • Computer Science
    International series in operations research and management science
  • 2007
TLDR
The second edition of Integrated Methods for Optimization focuses on ideas behind the methods that have proved useful in general-purpose optimization and constraint solvers, as well as integrated solvers of the present and foreseeable future.

Solving planning and scheduling problems with combined integer and constraint programming

TLDR
This paper presents a realistic planning problem of the chemical industry, which has been successfully treated with a hybrid approach to MIP/CP algorithms, and develops a very efficient hybrid MIP-CP solution strategy.

Towards a closer integration of finite domainpropagation and simplex-based algorithms

TLDR
Adaptations required in the hybrid method are described, encouraging experimental results indicate that the integration of the two environments is suitable for this application in particular, and may generally yield significant benefits.

Logic, Optimization, and Constraint Programming

  • J. Hooker
  • Computer Science
    INFORMS J. Comput.
  • 2002
TLDR
This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how they can be combined.

Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

TLDR
The development of an efficient solution strategy for obtaining global optima of continuous, integer, and mixed-integer nonlinear programs is addressed and novel relaxation schemes, range reduction tests, and branching strategies are developed which are incorporated into the prototypical branch-and-bound algorithm.

Cost-Based Domain Filtering

TLDR
By using cost-based filtering in global constraints, this work can optimally solve problems that are one order of magnitude greater than those solved by pure CP approaches, and it outperform other hybrid approaches integrating OR techniques in Constraint Programming.

A new approach to integrating mixed integer programming and constraint logicprogramming

This paper represents an integration of Mixed Integer Programming (MIP) and ConstraintLogic Programming (CLP) which, like MIP, tightens bounds rather than adding constraintsduring search. The
...