Erlendur S. Thorsteinsson

Publications11
h-index7
Citations342
Highly Influential Citations21
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • G. Ottosson
  • 21 Publications, 1,179 Citations
  • J. Hooker
  • 269 Publications, 7,004 Citations
  • Pascal Van Hentenryck
  • 523 Publications, 15,377 Citations
  • Y. Caseau
  • 70 Publications, 1,414 Citations
  • Publications
  • Influence
Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming
TLDR
We present Branch- and-Check, a hybrid framework integrating Mixed Integer Programming and Constraint Logic Programming, which encapsulates the traditional Benders Decomposition and Branch-and-Bound as special cases. Expand
  • 144
  • 11
On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization
TLDR
We propose a declarative modeling framework in which the structure of the constraints indicates how LP and CP can interact to solve the problem. Expand
  • 66
  • 4
  • PDF
The Role of Integer Programming Techniques in Constraint Programming's Global Constraints
TLDR
We argue the benefits of constraint programming's global constraints as a basis for such an integration and discuss the advantages along with some examples. Expand
  • 26
  • 3
Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts
TLDR
In hybrid solvers for combinatorial optimisation, combining Constraint (Logic) Programming (CLP) and Mixed Integer Programming (MIP), it is important to have tight connections between the two domains. Expand
  • 45
  • 1
  • PDF
Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers
TLDR
In this paper, we continue exploring the integration of constraint programming and mathematical programming, specifically Constraint Propagation (CP) and Linear Programming (LP), extending our previous work. Expand
  • 28
  • 1
Bran h-and-Che k: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logi Programming
  • 11
  • 1
Mixed Global Constraints and Inference in Hybrid CLP-IP Solvers
TLDR
This paper identifies constraints as the essential link between Constraint (Logic) Programming (CLP) and Mixed Integer Programming (IP) and introduces an algorithm for bidirectional inference through these constraints. Expand
  • 18
The Benefits of Global Constraints for the Integration of Constraint Programming and Integer Programming
Efforts aimed at combining Operations Research and Constraint Programming have become increasingly prominent and successful in the last few years. It is now widely recognized that integrating… Expand
  • 4
  • PDF
Òòòð× Óó Ååøøøññøø Blockin× Òò Öøøø Blockin
Ääòòòö Êêððüüøøóò× Òò Êêêù Blockin