scientific article; zbMATH DE number 1016966
From MaRDI portal
Publication:4339078
zbMATH Open0869.00019MaRDI QIDQ4339078FDOQ4339078
Authors:
Publication date: 4 June 1997
Title of this publication is not available (Why is that?)
Recommendations
Parallel numerical computation (65Y05) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Cited In (only showing first 100 items - show all)
- A multiperiod single processor scheduling problem with periodic requirements
- Generating a mixed mesh of hexahedra, pentahedra and tetrahedra from an underlying tetrahedral mesh
- Heuristic and metaheuristic methods for computing graph treewidth
- CLASSI: A classification model for the study of sequential processes and individual differences therein
- Sequencing and scheduling for filling lines in dairy production
- Subthreshold-seeking local search
- Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- Positive role of glassy dynamics in finite-time optimization by threshold algorithms
- A framework for analyzing sub-optimal performance of local search algorithms
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- Local search with a SAT oracle for combinatorial optimization
- An efficient local search method for random 3-satisfiability
- Scheduling projects with labor constraints
- Heuristic algorithms for visiting the customers in a rolling schedule environment
- Analyzing the complexity of finding good neighborhood functions for local search algorithms
- A local search template.
- New quaternary linear codes with covering radius 2
- Mechanisms for local search
- Neural networks for facility location problems
- Application of heuristic methods for conformance test selection
- A simulated annealing algorithm for determining the thickness of a graph
- Multiprogramming genetic algorithm for optimization problems with permutation property
- Optimal search strategies using simultaneous generalized hill climbing algorithms
- Parallel local search
- Combining the scalability of local search with the pruning techniques of systematic search
- Approximating minimum size \{1,2\}-connected networks
- Efficient local search for pseudo Boolean optimization
- Revisiting constraint-directed search
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
- A pegging approach to the precedence-constrained knapsack problem
- Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
- A fractional model for locating semi-desirable facilities on networks
- The single-finger keyboard layout problem
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- Hybrid genetic algorithm for optimization problems with permutation property
- A divide-and-conquer local search heuristic for data visualization
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Optimization, block designs and no free lunch theorems
- An asymmetric vehicle routing problem arising in the collection and disposal of special waste
- Structural analysis of local search heuristics in combinatorial optimization
- Better Algorithms and Bounds for Directed Maximum Leaf Problems
- Generic incremental algorithms for local search
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Extended neighborhood: Definition and characterization
- Stochastic optimization model of locomotive assignment to freight trains
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- Application of the noising method to the travelling salesman problem
- ARMS: an automated resource management system for British telecommunications plc
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Visiting near-optimal solutions using local search algorithms
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Two new algorithms for UMTS access network topology design
- The real-valued model of hierarchical classes
- On local search in d.c. optimization problems
- Computing Stable Outcomes in Hedonic Games
- Fast local search algorithms for the handicapped persons transportation problem
- A queueing framework for routing problems with time-dependent travel times
- An exponential (matching based) neighborhood for the vehicle routing problem
- Sequential search and its application to vehicle-routing problems
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- Solving the flight perturbation problem with meta heuristics
- Using Markov chains to analyze the effectiveness of local search algorithms
- Improved bounds for vehicle routing solutions
- Local search and lower bounds for the patient admission scheduling problem
- On the convergence of generalized hill climbing algorithms
- Title not available (Why is that?)
- A survey of very large-scale neighborhood search techniques
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- Efficiency of Local Search
- Computer search for small complete caps
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Recent advances on two-dimensional bin packing problems
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
- Heuristics for the traveling repairman problem with profits
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
- Local search algorithms for the \(k\)-cardinality tree problem.
- General local search methods
- Equilibria, fixed points, and complexity classes
- The noising methods: A generalization of some metaheuristics
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Dealing with repetitions in sequencing by hybridization
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Heuristics for automated knowledge source integration and service composition
- Expanding neighborhood GRASP for the traveling salesman problem
- A review of methods for input/output selection
- Approximate Local Search in Combinatorial Optimization
- An MCDM approach to portfolio optimization.
- The minimum shift design problem
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures
- Heuristics for the maximum outerplanar subgraph problem
- The periodic vehicle routing problem with intermediate facilities
- Two-dimensional packing problems: a survey
- Title not available (Why is that?)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- On solving complex multi-period location models using simulated annealing.
- Metaheuristics in combinatorial optimization
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 Q4339078)
