Data transfer planning with tree placement for collaborative environments

DOI10.1007/s10601-011-9106-7zbMath1234.68364DBLPjournals/constraints/HolubRL11OpenAlexW2024745460WikidataQ62924496 ScholiaQ62924496MaRDI QIDQ647480

Hana Rudová, Miloš Liška, Petr Holub

Publication date: 23 November 2011

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-011-9106-7

zbMATH Keywords

constraint programmingcollaborative environmentsdata networksdata transfer planning

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14)

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• A survey of combinatorial optimization problems in multicast routing
• Placement of proxy-based multicast overlays
• Integer Programming Formulation of Traveling Salesman Problems
• Teaching Integer Programming Formulations Using the Traveling Salesman Problem
• A hybrid multicommodity routing algorithm for traffic engineering
• Planning and Scheduling in Manufacturing and Services
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Data transfer planning with tree placement for collaborative environments