scientific article; zbMATH DE number 1062113
From MaRDI portal
Publication:4354785
zbMATH Open0930.90083MaRDI QIDQ4354785FDOQ4354785
Authors: Fred Glover, Manuel Laguna 
Publication date: 17 September 1997
Title of this publication is not available (Why is that?)
Recommendations
Parallel numerical computation (65Y05) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Mixed integer programming (90C11)
Cited In (only showing first 100 items - show all)
- Distributed personnel scheduling -- negotiation among scheduling agents
- A simple filter-and-fan approach to the facility location problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- Airport gate scheduling with time windows
- Balancing assembly lines with tabu search
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Particle swarm optimization and hill climbing for the bandwidth minimization problem
- Point of presence design in internet protocol networks with performance guarantees
- A dial-a-ride problem for client transportation in a health-care organization
- Repairing MIP infeasibility through local branching
- The development of a multi-objective tabu search algorithm for continuous optimisation problems
- Bounds for the single source modular capacitated plant location problem
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs
- Modelling and heuristics of FMS scheduling with multiple objectives
- 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
- Recent advances in tabu search
- An Introduction to Tabu Search
- A hybrid metaheuristic approach for the capacitated arc routing problem
- The bipartite quadratic assignment problem and extensions
- Local search heuristics for sectoring routing in a household waste collection context
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- A branch-and-price approach for a multi-period vehicle routing problem
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Branch and bound for the cutwidth minimization problem
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
- The case for strategic oscillation
- A hybrid metaheuristic approach to solving the UBQP problem
- Revising history for cost-informed process improvement
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- A GRASP metaheuristic for microarray data analysis
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- GRASP and path relinking for the equitable dispersion problem
- A tabu search algorithm for application placement in computer clustering
- Two approaches for solving the buffer allocation problem in unreliable production lines
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Stochastic resource allocation using a predictor-based heuristic for optimization via simulation
- Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- Simulation-based optimization for housekeeping in a container transshipment terminal
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
- Group-scheduling problems in electronics manufacturing
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- A black-box scatter search for optimization problems with integer variables
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Tabu search and GRASP for the maximum diversity problem
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles
- Variable space search for graph coloring
- Alternating control tree search for knapsack/covering problems
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- GRASP and path relinking for the max-min diversity problem
- A robust and efficient algorithm for planar competitive location problems
- Combined location-routing problems -- a neural network approach
- A solution method for a car fleet management problem with maintenance constraints
- Solving a minimum-power covering problem with overlap constraint for cellular network design
- Resource-constrained project scheduling: A critical activity reordering heuristic
- A tabu search algorithm for self-healing ring network design.
- Local search for shift design.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Tabu search for DNA sequencing with false negatives and false positives
- Determining buffer location and size in production lines using tabu search
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- Solving zero-one mixed integer programming problems using tabu search
- Comparison of metaheuristic algorithms for examination timetabling problem
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Variable neighborhood search strategies for the order batching problem
- ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- Scatter search for the cutwidth minimization problem
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Hybrid heuristics for examination timetabling problem
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
- Clustering categorical data sets using tabu search techniques
- A tabu search algorithm for assigning teachers to courses.
- An efficient heuristic for the expansion problem of cellular wireless networks
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- Variable neighbourhood search for bandwidth reduction
- A very fast TS/SA algorithm for the job shop scheduling problem
- A tabu search heuristic and adaptive memory procedure for political districting
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Consistency of community detection in networks under degree-corrected stochastic block models
- Lower and upper bounds for the bin packing problem with fragile objects
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354785)
