English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Non-overlapping Constraints between Convex Polytopes

Beldiceanu, N., Guo, Q., & Thiel, S. (2001). Non-overlapping Constraints between Convex Polytopes. In T. Walsh (Ed.), Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01) (pp. 392-407). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Beldiceanu, Nicolas, Author
Guo, Qi, Author
Thiel, Sven1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-022001
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518193
URI: http://link.springer.de/link/service/series/0558/papers/2010/20100431.pdf
Other: Local-ID: C1256428004B93B8-29163ABA2772E542C1256B28004C066C-BGT01:non-overlap
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Paphos, Cyprus
Start-/End Date: 2004-01-07 - 2004-01-07

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01)
Source Genre: Proceedings
 Creator(s):
Walsh, Toby1, Editor           
Affiliations:
1 Programming Logics, MPI for Informatics, Max Planck Society, ou_40045            
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 392 - 407 Identifier: ISBN: 3-540-42863-1

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2239 Sequence Number: - Start / End Page: - Identifier: -