Pages that link to "Item:Q4202466"

The following pages link to Bandwidth Packing: A Tabu Search Approach (Q4202466):

Displaying 21 items.

• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays (Q2361145) (← links)
• Generic incremental algorithms for local search (Q2385177) (← links)
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
• Multiobjective blockmodeling for social network analysis (Q2442107) (← links)
• Metaheuristics approach to the aircrew rostering problem (Q2468747) (← links)
• The selection and scheduling of telecommunication calls with time windows (Q2484356) (← links)
• A tutorial on the cross-entropy method (Q2485925) (← links)
• Path relinking for the vehicle routing problem (Q2491329) (← links)
• Solving the flight perturbation problem with meta heuristics (Q2491332) (← links)
• A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
• Path relinking and GRG for artificial neural networks (Q2570150) (← links)
• Generating Fingerings for Polyphonic Piano Music with a Tabu Search Algorithm (Q2942320) (← links)
• (Q2986008) (← links)
• On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
• An Integer Programming Approach to the Bandwidth Packing Problem (Q4363676) (← links)
• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows (Q6065841) (← links)
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← links)
• Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances (Q6164352) (← links)
• Semiparametric Bayesian networks (Q6188204) (← links)
• Multicommodity information flow through quantum annealer (Q6617048) (← links)