Data transfer planning with tree placement for collaborative environments
DOI10.1007/S10601-011-9106-7zbMATH Open1234.68364DBLPjournals/constraints/HolubRL11OpenAlexW2024745460WikidataQ62924496 ScholiaQ62924496MaRDI QIDQ647480FDOQ647480
Authors: Petr Holub, Hana Rudová, Miloš Liška
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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- The traveling salesman problem. A computational study.
- Handbook of constraint programming.
- Integer Programming Formulation of Traveling Salesman Problems
- Title not available (Why is that?)
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Title not available (Why is that?)
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Planning and Scheduling in Manufacturing and Services
- Title not available (Why is that?)
- A survey of combinatorial optimization problems in multicast routing
- Title not available (Why is that?)
- Placement of proxy-based multicast overlays
- Teaching Integer Programming Formulations Using the Traveling Salesman Problem
- A hybrid multicommodity routing algorithm for traffic engineering
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
Uses Software
This page was built for publication: Data transfer planning with tree placement for collaborative environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647480)