CLP Approaches to 2D Angle Placements

Simple item page
dc.creatorSzczygiel, Tomasz
dc.date2001-09-24
dc.date.accessioned2026-07-07T03:17:36Z
dc.date.available2026-07-07T03:17:36Z
dc.descriptionThe paper presents two CLP approaches to 2D angle placements, implemented in CHIP v.5.3. The first is based on the classical (rectangular) cumulative global constraint, the second on the new trapezoidal cumulative global constraint. Both approaches are applied to a specific presented.
dc.descriptionPresented at the 6th Annual Workshop of the ERCIM Working Group on Constraints, 2001
dc.identifierhttps://arxiv.org/abs/cs/0109066
dc.identifierhttp://arxiv.org/abs/cs/0109066
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30783
dc.subjectProgramming Languages
dc.subjectD.3.3
dc.titleCLP Approaches to 2D Angle Placements
dc.typetext

Files

Collections

arXiv