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 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
- Lot sizing and furnace scheduling in small foundries
- Convergence properties of the cross-entropy method for discrete optimization
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- A note on single alternating cycle neighborhoods for the TSP
- Simulated annealing for complex portfolio selection problems.
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Record breaking optimization results using the ruin and recreate principle
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- Local search for the Steiner tree problem in the Euclidean plane
- A heuristic genetic algorithm for product portfolio planning
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Heuristics for cardinality constrained portfolio optimization
- Comparing different metaheuristic approaches for the median path problem with bounded length
- Neighborhood portfolio approach for local search applied to timetabling problems
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Order-based neighborhoods for project scheduling with nonregular objective functions.
- Minimizing Rosenthal potential in multicast games
- Local search for shift design.
- Deterministic job-shop scheduling: Past, present and future
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- Minimizing total weighted tardiness in a generalized job shop
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Graph clustering
- A new neighborhood structure for round robin scheduling problems
- Two local search approaches for solving real-life car sequencing problems
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- A heuristic algorithm for solving hazardous materials distribution problems.
- Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff
- Flowshop scheduling research after five decades
- Metaheuristics: A bibliography
- Noising methods for a clique partitioning problem
- An evolutionary heuristic for quadratic 0-1 programming
- Hybrid metaheuristics: an introduction
- Local search algorithms for the multiprocessor flow shop scheduling problem
- On local optima in multiobjective combinatorial optimization problems
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Simple Local Search Problems that are Hard to Solve
- Problems of discrete optimization: challenges and main approaches to solve them
- 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
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)
