License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2022.31
URN: urn:nbn:de:0030-drops-166607
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16660/
Go to the corresponding LIPIcs Volume Portal

Lee, Jimmy H. M. ; Zhong, Allen Z.

Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization

pdf-format:
LIPIcs-CP-2022-31.pdf (0.8 MB)

Abstract

Dominance breaking is an effective technique to reduce the time for solving constraint optimization problems. Lee and Zhong propose an automatic dominance breaking framework for a class of constraint optimization problems based on specific forms of objectives and constraints. In this paper, we propose to enhance the framework for problems with nested function calls which can be flattened to functional constraints. In particular, we focus on aggregation functions and exploit such properties as monotonicity, commutativity and associativity to give an efficient procedure for generating effective dominance breaking nogoods. Experimentation also shows orders-of-magnitude runtime speedup using the generated dominance breaking nogoods and demonstrates the ability of our proposal to reveal dominance relations in the literature and discover new dominance relations on problems with ineffective or no known dominance breaking constraints.

BibTeX - Entry

@InProceedings{lee_et_al:LIPIcs.CP.2022.31,
  author =	{Lee, Jimmy H. M. and Zhong, Allen Z.},
  title =	{{Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization}},
  booktitle =	{28th International Conference on Principles and Practice of Constraint Programming (CP 2022)},
  pages =	{31:1--31:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-240-2},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{235},
  editor =	{Solnon, Christine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16660},
  URN =		{urn:nbn:de:0030-drops-166607},
  doi =		{10.4230/LIPIcs.CP.2022.31},
  annote =	{Keywords: Constraint Optimization Problems, Dominance Breaking}
}

Keywords: Constraint Optimization Problems, Dominance Breaking
Collection: 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
Issue Date: 2022
Date of publication: 23.07.2022
Supplementary Material: Software (Source Code): https://github.com/AllenZzw/auto-dom

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI