Bandwidth Packing: A Tabu Search Approach
From MaRDI portal
Publication:4202466
DOI10.1287/mnsc.39.4.492zbMath0774.90033OpenAlexW2141528064MaRDI QIDQ4202466
Publication date: 31 August 1993
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.39.4.492
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A cutting plane approach to combinatorial bandwidth packing problem with queuing delays, Using the tabu search method for the distribution of supplies in a hospital, A tabu search heuristic for the quay crane scheduling problem, Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities, A survey of search methodologies and automated system development for examination timetabling, A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows, A study of diversification strategies for the quadratic assignment problem, Genetic algorithms and tabu search: Hybrids for optimization, The depth and width of local minima in discrete solution spaces, Bandwidth packing problem with queueing delays: modelling and exact solution approach, Generic incremental algorithms for local search, The cross-entropy method for continuous multi-extremal optimization, Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements, Hybrid semiparametric Bayesian networks, ATM VP-based network design, Common due-date determination and sequencing using tabu search, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Tabu search for graph partitioning, A tabu thresholding algorithm for arc crossing minimization in bipartite graphs, A tabu search algorithm for frequency assignment, Metaheuristics: A bibliography, Generating Fingerings for Polyphonic Piano Music with a Tabu Search Algorithm, Tabu search for the multilevel generalized assignment problem, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, The invisible‐hand heuristic for origin‐destination integer multicommodity network flows, Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees, The combinatorial bandwidth packing problem, Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances, A composite heuristic for the single machine early/tardy job scheduling problem., New bounds for optimum traffic assignment in satellite communication., Semiparametric Bayesian networks, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Multiobjective blockmodeling for social network analysis, A filter-and-fan approach to the 2D HP model of the protein folding problem, Tabu search for fuzzy optimization and applications., A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, Modelling the dynamics of stochastic local search on \(k\)-SAT, Infeasible/feasible search trajectories and directional rounding in integer programming, Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks, Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis, On the minimum cost multiple-source unsplittable flow problem, Bandwidth packing with priority classes, Metaheuristics approach to the aircrew rostering problem, Finding good nurse duty schedules: a case study, The selection and scheduling of telecommunication calls with time windows, A tutorial on the cross-entropy method, Path relinking for the vehicle routing problem, Solving the flight perturbation problem with meta heuristics, A study of ACO capabilities for solving the maximum clique problem, An exact solution method for reliability optimization in complex systems, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Applying tabu search to backup path planning for multicast networks, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures, The multi-mode resource-constrained project scheduling problem with generalized precedence relations, Massively parallel analog tabu search using neural networks applied to simple plant location problems, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A branch and price approach for the robust bandwidth packing problem with queuing delays, Location of hubs in a competitive environment, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, Path relinking and GRG for artificial neural networks, Digital data networks design using genetic algorithms, Tabu list management methods for a discrete-continuous scheduling problem, A tabu search algorithm for the optimisation of telecommunication networks, A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation, Global optimization for artificial neural networks: A tabu search application, A two-phase tabu search approach to the location routing problem
Uses Software
