2 Search Results for "Brand, Sebastian"

Document
DOI: 10.4230/LIPIcs.ICLP.2011.117
Constraints in Non-Boolean Contexts

Authors: Leslie De Koninck, Sebastian Brand, and Peter J. Stuckey

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

Abstract
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of constraints on local variables in non-Boolean expressions. Specifications using these facilities are often more succinct. However, these specifications are typically executed on solvers that only support questions of the form of existentially quantified conjunctions of constraints. We show how we can translate expressions with constraints appearing in non-Boolean contexts into conjunctions of ordinary constraints. The translation is clearly structured into constrained type elimination, local variable lifting and partial function elimination. We explain our approach in the context of the modelling language Zinc. An implementation of it is an integral part of our Zinc compiler.
Cite as

Leslie De Koninck, Sebastian Brand, and Peter J. Stuckey. Constraints in Non-Boolean Contexts. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 117-127, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{dekoninck_et_al:LIPIcs.ICLP.2011.117,
  author =	{De Koninck, Leslie and Brand, Sebastian and Stuckey, Peter J.},
  title =	{{Constraints in Non-Boolean Contexts}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{117--127},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.117},
  URN =		{urn:nbn:de:0030-drops-31685},
  doi =		{10.4230/LIPIcs.ICLP.2011.117},
  annote =	{Keywords: Constraint modelling languages, model transformation, partial functions}
}
Document
DOI: 10.4230/DagSemProc.09261.6
Branch-and-Price Solving in G12

Authors: Jakob Puchinger, Peter Stuckey, Mark Wallace, and Sebastian Brand

Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)

Abstract
The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to control this process. In this paper we explain the mapping to branch-and-price solving. G12 supports the selection of specialised subproblem solvers, the aggregation of identical subproblems, automatic disaggregation when required by search, and the use of specialised branching rules. We demonstrate the benefits of the G12 framework on three examples: a trucking problem, cutting stock, and two-dimensional bin packing.
Cite as

Jakob Puchinger, Peter Stuckey, Mark Wallace, and Sebastian Brand. Branch-and-Price Solving in G12. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{puchinger_et_al:DagSemProc.09261.6,
  author =	{Puchinger, Jakob and Stuckey, Peter and Wallace, Mark and Brand, Sebastian},
  title =	{{Branch-and-Price Solving in G12}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.6},
  URN =		{urn:nbn:de:0030-drops-21641},
  doi =		{10.4230/DagSemProc.09261.6},
  annote =	{Keywords: Combinatorial optimization, branch-and-price, software}
}
  • Refine by Author
  • 2 Brand, Sebastian
  • 1 De Koninck, Leslie
  • 1 Puchinger, Jakob
  • 1 Stuckey, Peter
  • 1 Stuckey, Peter J.
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 Combinatorial optimization
  • 1 Constraint modelling languages
  • 1 branch-and-price
  • 1 model transformation
  • 1 partial functions
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2009
  • 1 2011

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact