Pages that link to "Item:Q3028342"
From MaRDI portal
The following pages link to Random Trees and the Analysis of Branch and Bound Procedures (Q3028342):
Displaying 13 items.
- Modeling of uplink power control for cognitive radio networks: cooperative and noncooperative (Q646164) (← links)
- On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978) (← links)
- A simulation tool for the performance evaluation of parallel branch and bound algorithms (Q1111941) (← links)
- A randomized parallel branch-and-bound algorithm (Q1118396) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
- (Q4262221) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)
- Performance of linear-space search algorithms (Q5925571) (← links)
- Towards an abstract parallel branch and bound machine (Q6560207) (← links)
- Parallel best-first branch-and-bound in discrete optimization: a framework (Q6560208) (← links)
