Abstract
Abstract We consider the layout of divisible activities on the line. Each activity is divisible in the sense that it may be a collection of disjoint intervals, with the sum of the lengths of the intervals being known. We construct objective functions involving measures of costs proportional to distances between activities, establish that to find optimal layouts it is enough to consider only symmetric layouts, and present algorithms for choosing best symmetric layouts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
