Cited in
(only showing first 100 items - show all)- Heuristics for integrated optimization of catheter positioning and Dwell time distribution in prostate HDR brachytherapy
- Adaptive memory programming for matrix bandwidth minimization
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Backbone analysis and algorithm design for the quadratic assignment problem
- Modelling constant weight codes using tabu search
- A tabu search heuristic and adaptive memory procedure for political districting
- An advanced tabu search algorithm for the job shop problem
- Visiting near-optimal solutions using local search algorithms
- Distributed personnel scheduling -- negotiation among scheduling agents
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Evolution and state-of-the-art in integer programming
- A simple filter-and-fan approach to the facility location problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- Arc routing in a node routing environment
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- Stochastic global optimization using tangent minorants for Lipschitz functions
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Path relinking and GRG for artificial neural networks
- A tabu search algorithm for difference triangle sets and Golomb rulers
- Airport gate scheduling with time windows
- Feasibility Pump-like heuristics for mixed integer problems
- Design of computer experiments: space filling and beyond
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
- Balancing assembly lines with tabu search
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
- Unforeseen Consequences of “Tabu” Choices—A Retrospective
- Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill
- MILP approach to pattern generation in logical analysis of data
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Scheduling satellite launch missions: an MILP approach
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Stability analysis of the bat algorithm described as a stochastic discrete-time state-space system
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Solution methods for a scheduling problem with incompatibility and precedence constraints
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Dominance-based heuristics for one-machine total cost scheduling problems
- Particle swarm optimization and hill climbing for the bandwidth minimization problem
- Point of presence design in internet protocol networks with performance guarantees
- Competitive location and pricing on networks with random utilities
- An iterated tabu search for the multi-compartment vehicle routing problem
- Economic application in a finite capacity multi-channel queue with second optional channel
- Simulation and optimization of sludge hygienization research irradiator
- Tabu search -- uncharted domains
- Sidelobe level reduction in linear array pattern synthesis using particle swarm optimization
- Diversification strategies in local search for a nonbifurcated network loading problem
- Some assignment problems arising from multiple target tracking
- Optimization by ghost image processes in neural networks
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
- A dial-a-ride problem for client transportation in a health-care organization
- The linear ordering problem with clusters: a new partial ranking
- Multistart search for the cyclic cutwidth minimization problem
- Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- A branch and bound algorithm for the matrix bandwidth minimization
- An improved simulated annealing algorithm for bandwidth minimization
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- Repairing MIP infeasibility through local branching
- The development of a multi-objective tabu search algorithm for continuous optimisation problems
- Optimization via low-rank approximation for community detection in networks
- The hot strip mill production scheduling problem: A tabu search approach
- Batch repair actions for automated troubleshooting
- Solving the wire-harness design problem at a European car manufacturer
- Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
- Bounds for the single source modular capacitated plant location problem
- A study of ACO capabilities for solving the maximum clique problem
- Reducing the bandwidth of a sparse matrix with tabu search.
- A hybrid heuristic for an inventory routing problem
- Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities.
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
- Lower and upper bounds for the bin packing problem with fragile objects
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- D-optimal designs for sensor and actuator locations
- An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs
- A path relinking approach with ejection chains for the generalized assignment problem
- Modelling and heuristics of FMS scheduling with multiple objectives
- Construction of exact D-optimal designs by tabu search
- Heuristic and metaheuristic methods for computing graph treewidth
- A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems
- COLE: a new heuristic approach for fixed charge problem computational results
- Comparing metaheuristic algorithms for SONET network design problems
- Consistency of community detection in networks under degree-corrected stochastic block models
- Multiobjective blockmodeling for social network analysis
- Fast local search algorithms for the handicapped persons transportation problem
- The linehaul-feeder vehicle routing problem with virtual depots and time windows
- Multipath adaptive tabu search for a vehicle control problem
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- Risk approaches for delivering disaster relief supplies
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
- Feature Selection SDA Method in Ensemble Nearest Neighbor Classifier
- Real-time system with homogeneous servers and nonidentical channels in steady-state
- NeuroGenetic approach for combinatorial optimization: an exploratory analysis
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- Consistent neighborhood search for combinatorial optimization
- Human-guided search
This page was built for software: Tabu search
