scientific article; zbMATH DE number 1016966
From MaRDI portal
Publication:4339078
zbMath0869.00019MaRDI QIDQ4339078
No author found.
Publication date: 4 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Parallel numerical computation (65Y05) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
Computing Stable Outcomes in Hedonic Games ⋮ Exponential size neighborhoods for makespan minimization scheduling ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem ⋮ Point and confidence interval estimates for a global maximum via extreme value theory ⋮ Multiple Optimal Solutions in the Portfolio Selection Model with Short-Selling ⋮ On the theoretical properties of swap multimoves ⋮ AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES ⋮ A simulated annealing algorithm for the maximum planar subgraph problem ⋮ The secure time-dependent vehicle routing problem with uncertain demands ⋮ Hybrid Metaheuristics: An Introduction ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ Unnamed Item ⋮ Collaborative optimization of workshop layout and scheduling ⋮ Metaheuristics: A Canadian Perspective ⋮ Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ Visiting near-optimal solutions using local search algorithms ⋮ Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics ⋮ About the choice of the variable to unassign in a decision repair algorithm ⋮ A personal perspective on problem solving by general purpose solvers ⋮ 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. ⋮ A review of methods for input/output selection ⋮ A novel technique of object ranking and classification under ignorance: an application to the corporate failure risk problem ⋮ Sequential search and its application to vehicle-routing problems ⋮ Noising methods for a clique partitioning problem ⋮ Generating a mixed mesh of hexahedra, pentahedra and tetrahedra from an underlying tetrahedral mesh ⋮ Expanding neighborhood GRASP for the traveling salesman problem ⋮ Solving the flight perturbation problem with meta heuristics ⋮ Creating very large scale neighborhoods out of smaller ones by compounding moves ⋮ A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem ⋮ Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem ⋮ A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem ⋮ Scheduling projects with labor constraints ⋮ Local search algorithms for a single-machine scheduling problem with positive and negative time-lags ⋮ A divide-and-conquer local search heuristic for data visualization ⋮ Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines ⋮ The noising methods: A generalization of some metaheuristics ⋮ A fractional model for locating semi-desirable facilities on networks ⋮ Neighborhood portfolio approach for local search applied to timetabling problems ⋮ Better Algorithms and Bounds for Directed Maximum Leaf Problems ⋮ The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures ⋮ Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty ⋮ Heuristic and metaheuristic methods for computing graph treewidth ⋮ Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes ⋮ Unnamed Item ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ Flowshop scheduling research after five decades ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ Heuristics for the maximum outerplanar subgraph problem ⋮ A note on single alternating cycle neighborhoods for the TSP ⋮ Fast local search algorithms for the handicapped persons transportation problem ⋮ Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence ⋮ An efficient local search method for random 3-satisfiability ⋮ An asymmetric vehicle routing problem arising in the collection and disposal of special waste ⋮ A multiperiod single processor scheduling problem with periodic requirements ⋮ A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem ⋮ ARMS: an automated resource management system for British telecommunications plc ⋮ ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem ⋮ A queueing framework for routing problems with time-dependent travel times ⋮ Heuristic and exact algorithms for the spanning tree detection problem ⋮ Hybrid genetic algorithm for optimization problems with permutation property ⋮ A pegging approach to the precedence-constrained knapsack problem ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ Setup coordination between two stages of a production system: a multi-objective evolutionary approach ⋮ Heuristic algorithms for visiting the customers in a rolling schedule environment ⋮ The quadratic three-dimensional assignment problem: exact and approximate solution methods ⋮ Generic incremental algorithms for local search ⋮ Two new algorithms for UMTS access network topology design ⋮ Heuristics for the traveling repairman problem with profits ⋮ Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects ⋮ Analyzing the complexity of finding good neighborhood functions for local search algorithms ⋮ A new neighborhood structure for round robin scheduling problems ⋮ A heuristic genetic algorithm for product portfolio planning ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ Tabu search and iterated local search for the cyclic bottleneck assignment problem ⋮ On the minimum volume simplex enclosure problem for estimating a linear mixing model ⋮ Improved bounds for vehicle routing solutions ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ Metaheuristics: A bibliography ⋮ Parallel local search ⋮ Minimizing total weighted tardiness in a generalized job shop ⋮ Dealing with repetitions in sequencing by hybridization ⋮ Sequence independent lifting for mixed knapsack problems with GUB constraints ⋮ Order-based neighborhoods for project scheduling with nonregular objective functions. ⋮ An exponential (matching based) neighborhood for the vehicle routing problem ⋮ Simulated annealing for complex portfolio selection problems. ⋮ A local search template. ⋮ Local search and lower bounds for the patient admission scheduling problem ⋮ Using Markov chains to analyze the effectiveness of local search algorithms ⋮ Hybrid flow-shop scheduling problems with multiprocessor task systems. ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ A heuristic algorithm for solving hazardous materials distribution problems. ⋮ Local search for shift design. ⋮ Parameterized complexity and local search approaches for the stable marriage problem with ties ⋮ Graph clustering ⋮ Equilibria, fixed points, and complexity classes ⋮ An MCDM approach to portfolio optimization. ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ A tabu search method guided by shifting bottleneck for the job shop scheduling problem ⋮ Two local search approaches for solving real-life car sequencing problems ⋮ A mixed R{\&}D projects and securities portfolio selection model ⋮ Lot sizing and furnace scheduling in small foundries ⋮ Record breaking optimization results using the ruin and recreate principle ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ Local search with a SAT oracle for combinatorial optimization ⋮ Minimizing Rosenthal potential in multicast games ⋮ An analysis of neighborhood functions on generic solution spaces ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Convergence properties of the cross-entropy method for discrete optimization ⋮ CLASSI: A classification model for the study of sequential processes and individual differences therein ⋮ The minimum shift design problem ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ Stochastic optimization model of locomotive assignment to freight trains ⋮ Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues ⋮ Optimal search strategies using simultaneous generalized hill climbing algorithms ⋮ Local search inequalities ⋮ Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Sequencing and scheduling for filling lines in dairy production ⋮ A survey of very large-scale neighborhood search techniques ⋮ Recent advances on two-dimensional bin packing problems ⋮ Optimization models for targeted offers in direct marketing: exact and heuristic algorithms ⋮ Extended neighborhood: Definition and characterization ⋮ Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling ⋮ Positive role of glassy dynamics in finite-time optimization by threshold algorithms ⋮ A framework for analyzing sub-optimal performance of local search algorithms ⋮ Covering arrays of strength three from extended permutation vectors ⋮ Local search for the Steiner tree problem in the Euclidean plane ⋮ Revisiting constraint-directed search ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ An evolutionary heuristic for quadratic 0-1 programming ⋮ Local search algorithms for the \(k\)-cardinality tree problem. ⋮ The single-finger keyboard layout problem ⋮ New quaternary linear codes with covering radius 2 ⋮ Optimization, block designs and no free lunch theorems ⋮ Application of the noising method to the travelling salesman problem ⋮ Heuristics for cardinality constrained portfolio optimization ⋮ Computer search for small complete caps ⋮ Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing ⋮ An improved algorithm for the packing of unequal circles within a larger containing circle ⋮ Two-dimensional packing problems: a survey ⋮ Application of heuristic methods for conformance test selection ⋮ Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff ⋮ Local search algorithms for the multiprocessor flow shop scheduling problem ⋮ The periodic vehicle routing problem with intermediate facilities ⋮ Approximating minimum size \{1,2\}-connected networks ⋮ On the convergence of generalized hill climbing algorithms ⋮ A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls ⋮ Metaheuristics in combinatorial optimization ⋮ Combinatorial structure and randomized subexponential algorithms for infinite games ⋮ The real-valued model of hierarchical classes
