References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Devriendt, Jo; Gleixner, Ambros; Nordström, Jakob: Learn to relax: integrating (0-1) integer linear programming with pseudo-Boolean conflict-driven search (2021)
  2. Codish, Michael; Fekete, Yoav; Fuhs, Carsten; Schneider-Kamp, Peter: Optimal base encodings for pseudo-Boolean constraints (2011)
  3. Foulds, L. R.; Toklu, B.; Wilson, J. M.: Modelling either-or relations in integer programming (2009)
  4. Sheini, Hossein M.; Sakallah, Karem A.: Pueblo: a hybrid pseudo-Boolean SAT solver (2006)
  5. Kroening, Daniel; Ouaknine, Joël; Seshia, Sanjit A.; Strichman, Ofer: Abstraction-based satisfiability solving of Presburger arithmetic (2004)
  6. Plastria, Frank: Formulating logical implications in combinatorial optimisation (2002)
  7. Bollapragada, S.; Ghattas, O.; Hooker, J. N.: Optimal design of truss structures by logic-based branch and cut (2001)
  8. Dawid, Herbert; König, Johannes; Strauss, Christine: An enhanced rostering model for airline crews (2001)
  9. Williams, H. P.; Yan, Hong: Representations of the all_different predicate of constraint satisfaction in integer programming (2001)
  10. Bockmayr, Alexander; Eisenbrand, Friedrich: Combining logic and optimization in cutting plane theory (2000)
  11. Hooker, J. N.; Osorio, M. A.: Mixed logical-linear programming (1999)
  12. Bockmayr, Alexander; Kasper, Thomas: Branch and infer: A unifying framework for integer and finite domain constraint programming. (1998)
  13. Barth, Peter: Logic-based 0-1 constraint programming (1996)
  14. Barth, Peter: Linear (0-1) inequalities and extended clauses (1993)