Data transfer planning with tree placement for collaborative environments
From MaRDI portal
Publication:647480
Recommendations
Cites work
- scientific article; zbMATH DE number 1270594 (Why is no real title available?)
- scientific article; zbMATH DE number 1167865 (Why is no real title available?)
- scientific article; zbMATH DE number 5070513 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- A hybrid multicommodity routing algorithm for traffic engineering
- A survey of combinatorial optimization problems in multicast routing
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Handbook of constraint programming.
- Integer Programming Formulation of Traveling Salesman Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Placement of proxy-based multicast overlays
- Planning and Scheduling in Manufacturing and Services
- Principles and Practice of Constraint Programming – CP 2004
- Teaching Integer Programming Formulations Using the Traveling Salesman Problem
- The traveling salesman problem. A computational study.
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)